Runtime: 35 ms (Top 65.52%) | Memory: 42.2 MB (Top 56.90%)

Author: AnasImloul

scripts/algorithms/M/Maximum Number of Achievable Transfer Requests/Maximum Number of Achievable Transfer Requests.java

@@ -1,10 +1,11 @@
+// Runtime: 35 ms (Top 65.52%) | Memory: 42.2 MB (Top 56.90%)
 class Solution {
     int max = 0;
     public int maximumRequests(int n, int[][] requests) {
         helper(requests, 0, new int[n], 0);
         return max;
     }
-    
+
     private void helper(int[][] requests, int index, int[] count, int num) {
         // Traverse all n buildings to see if they are all 0. (means balanced)
         if (index == requests.length) {
@@ -16,14 +17,14 @@ private void helper(int[][] requests, int index, int[] count, int num) {
             max = Math.max(max, num);
             return;
         }
-		// Choose this request
+        // Choose this request
         count[requests[index][0]]++;
         count[requests[index][1]]--;
         helper(requests, index + 1, count, num + 1);
         count[requests[index][0]]--;
         count[requests[index][1]]++;
-        
-		// Not Choose the request
+
+        // Not Choose the request
         helper(requests, index + 1, count, num);
     }
 }