Runtime: 1534 ms (Top 45.54%) | Memory: 199 MB (Top 25.74%)

Author: AnasImloul

scripts/algorithms/C/Count Pairs Of Nodes/Count Pairs Of Nodes.cpp

@@ -1,14 +1,15 @@
+// Runtime: 1534 ms (Top 45.54%) | Memory: 199 MB (Top 25.74%)
 class Solution {
 public:
     map<pair<int, int>, int>edgeCount;
     vector<int>degree;
-    
+
     vector<int> countPairsHelper(vector<int>&indegree, vector<int>&queries, int n){
         vector<int>ans;
-        
+
         // for each query, time: O(2*n) for two pointer and O(uniqueEdgesCount)
-        for(int query: queries){         
-            // two pointer 
+        for(int query: queries){
+            // two pointer
             int i = 0, j = n-1, total = 0;
             while(i != j){
                 if(degree[i] + degree[j] > query){
@@ -23,8 +24,7 @@ class Solution {
                 total += (n-i-1);
                 i++;
             }
-            
-            
+
             // remove the negative contribution of edgeCount from all the pairs so far counted
             for(auto i: edgeCount){
                 int u = i.first.first, v = i.first.second, w = i.second;
@@ -38,7 +38,7 @@ class Solution {
         return ans;
     }
     vector<int> countPairs(int n, vector<vector<int>>& edges, vector<int>& queries) {
-        
+
         vector<int>indegree(n, 0);
         for(auto edge: edges){
             int x = edge[0], y = edge[1];
@@ -49,11 +49,11 @@ class Solution {
             indegree[u]++;
             indegree[v]++;
         }
-        
+
         for(int i = 0; i < n; ++i){
             degree.push_back(indegree[i]);
         }
         sort(degree.begin(), degree.end()); // sort degree to apply smart two pointer
         return countPairsHelper(indegree, queries, n);
     }
-};
+};