Runtime: 5 ms (Top 88.89%) | Memory: 40.7 MB (Top 100.00%)

Author: AnasImloul

scripts/algorithms/M/Maximum Points in an Archery Competition/Maximum Points in an Archery Competition.java

@@ -1,29 +1,30 @@
+// Runtime: 5 ms (Top 88.89%) | Memory: 40.7 MB (Top 100.00%)
    class Solution {
-		int bobPoint = 0;
-		int[] maxbob = new int[12];
-		public int[] maximumBobPoints(int numArrows, int[] aliceArrows) {
-			int[] bob = new int[12];
-			calculate(aliceArrows, bob, 11, numArrows, 0);  //Start with max point that is 11
-			return maxbob;
-		}
-		public void calculate(int[] alice, int[] bob, int index, int remainArr, int point) {
-			if(index < 0 || remainArr <= 0) {
-				if(remainArr > 0)
-					bob[0] += remainArr;
-				if(point > bobPoint) { // Update the max points and result output
-					bobPoint = point;
-					maxbob = bob.clone();
-				}
-				return;
-			}
-			//part 1: assign 1 more arrow than alice
-			if(remainArr >= alice[index]+1) {
-				bob[index] = alice[index] + 1;
-				calculate(alice, bob, index-1, remainArr-(alice[index]+1), point + index);
-				bob[index] = 0;
-			}
-			//part 2: assign no arrow and move to next point
-			calculate(alice, bob, index-1, remainArr, point);
-			bob[index] = 0;
-		}
-	}
+        int bobPoint = 0;
+        int[] maxbob = new int[12];
+        public int[] maximumBobPoints(int numArrows, int[] aliceArrows) {
+            int[] bob = new int[12];
+            calculate(aliceArrows, bob, 11, numArrows, 0); //Start with max point that is 11
+            return maxbob;
+        }
+        public void calculate(int[] alice, int[] bob, int index, int remainArr, int point) {
+            if(index < 0 || remainArr <= 0) {
+                if(remainArr > 0)
+                    bob[0] += remainArr;
+                if(point > bobPoint) { // Update the max points and result output
+                    bobPoint = point;
+                    maxbob = bob.clone();
+                }
+                return;
+            }
+            //part 1: assign 1 more arrow than alice
+            if(remainArr >= alice[index]+1) {
+                bob[index] = alice[index] + 1;
+                calculate(alice, bob, index-1, remainArr-(alice[index]+1), point + index);
+                bob[index] = 0;
+            }
+            //part 2: assign no arrow and move to next point
+            calculate(alice, bob, index-1, remainArr, point);
+            bob[index] = 0;
+        }
+    }