10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T411,class Solution { public int[] countServers(int n, int[][] logs, int x, int[] queries) { Arrays.sort(logs, (a, b) -> Integer.compare(a[1], b[1])); int k = queries.length; Integer[] ids = new Integer[k]; for (int i = 0; i < k; i++) ids[i] = i; Arrays.sort(ids, (a, b) -> Integer.compare(queries[a], queries[b])); int[] ans = new int[k]; int[] cnt = new int[n + 1]; int left = 0, right = 0, active = 0; for (int i : ids) { int q = queries[i]; while (right < logs.length && logs[right][1] <= q) { int id = logs[right][0]; if (cnt[id] == 0) active++; cnt[id]++; right++; } while (left < right && logs[left][1] < q - x) { int id = logs[left][0]; cnt[id]--; if (cnt[id] == 0) active--; left++; } ans[i] = n - active; } return ans; } }13:T47b,class Solution { public: vector countServers(int n, vector>& logs, int x, vector& queries) { sort(logs.begin(), logs.end(), [](const vector& a, const vector& b) { return a[1] < b[1]; }); int k = queries.size(); vector ids(k); iota(ids.begin(), ids.end(), 0); sort(ids.begin(), ids.end(), [&](int a, int b) { return queries[a] < queries[b]; }); vector ans(k); vector cnt(n + 1, 0); int left = 0, right = 0, active = 0; for (int i : ids) { int q = queries[i]; while (right < logs.size() && logs[right][1] <= q) { int id = logs[right][0]; if (cnt[id] == 0) active++; cnt[id]++; right++; } while (left < right && logs[left][1] < q - x) { int id = logs[left][0]; cnt[id]--; if (cnt[id] == 0) active--; left++; } ans[i] = n - active; } return ans; } };

Time Complexity

Space Complexity