Runtime: 884 ms (Top 5.06%) | Memory: 117.5 MB (Top 5.06%)

Author: AnasImloul

scripts/algorithms/S/Stone Game II/Stone Game II.java

@@ -1,3 +1,4 @@
+// Runtime: 884 ms (Top 5.06%) | Memory: 117.5 MB (Top 5.06%)
 class Solution {
     public int stoneGameII(int[] piles) {
         Map<String, Integer> memo = new HashMap<>();
@@ -7,35 +8,34 @@ public int stoneGameII(int[] piles) {
             totalSum+=ele;
         return (diff+totalSum)/2;
     }
-    
-    
+
     public int stoneGame(int[] piles, int M, int index, int turn,Map<String, Integer> memo )
     {
         if(index >= piles.length)
             return 0;
         if(memo.containsKey(index+"-"+M+"-"+turn))
             return memo.get(index+"-"+M+"-"+turn);
         int score=0,maxScore=Integer.MIN_VALUE;
-		// Alice's turn
+        // Alice's turn
         if(turn == 0)
         {
             for(int X=1;X<=2*M && index+X-1<piles.length;X++)
             {
                 score += piles[index+X-1];
                 maxScore= Math.max(maxScore,stoneGame(piles,Math.max(X,M),index+X,1,memo)+score);
-            }    
+            }
             memo.put(index+"-"+M+"-"+turn,maxScore);
             return maxScore;
         }
         // Bob's turn
         int minScore=Integer.MAX_VALUE;
         for(int X=1;X<=2*M && index+X-1<piles.length;X++)
         {
-            score += piles[index+X-1]; 
+            score += piles[index+X-1];
             minScore = Math.min(minScore, stoneGame(piles,Math.max(X,M),index+X,0,memo) - score ) ;
         }
         memo.put(index+"-"+M+"-"+turn,minScore);
         return minScore;
     }
-    
-}
+
+}