060523

Author: aluferraz

src/Main.java

@@ -1,4 +1,5 @@
 import leetcode.editor.en.Q1035.UncrossedLines;
+import leetcode.editor.en.Q1140.StoneGameIi;
 import leetcode.editor.en.Q1220.CountVowelsPermutation;
 import leetcode.editor.en.Q1259.HandshakesThatDontCross;
 import leetcode.editor.en.Q1473.PaintHouseIii;
@@ -25,6 +26,7 @@
 import leetcode.editor.en.Q651.FourKeysKeyboard;
 import leetcode.editor.en.Q703.KthLargestElementInAStream;
 import leetcode.editor.en.Q785.IsGraphBipartite;
+import leetcode.editor.en.Q837.New21Game;
 import leetcode.editor.en.Q91.DecodeWays;
 import leetcode.editor.en.Q934.ShortestBridge;
 import org.json.JSONArray;
@@ -40,7 +42,9 @@
 
 public class Main {
     public static void main(String[] args) throws IOException {
-        System.out.println(new MaximumSubsequenceScore().maxScore(toIntArray("[23,16,20,7,3]"), toIntArray("[19,21,22,22,12]"), 3));
+        System.out.println(new New21Game().new21Game(185, 183, 2));
+//        System.out.println(new StoneGameIi().stoneGameII(toIntArray("[77,12,64,35,28,4,87,21,20]")));
+
 
     }
 

src/leetcode/editor/en/Q1140/StoneGameIi.java

@@ -0,0 +1,56 @@
+package leetcode.editor.en.Q1140;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+
+    private final static int ALICE = 0;
+    HashMap<Pair<Integer, Integer>, Integer> cache;
+
+    public int stoneGameII(int[] piles) {
+        cache = new HashMap<>();
+        int aliceScore = stoneGameII(ALICE, 0, 1, piles);
+        int totalStones = Arrays.stream(piles).sum();
+
+        //totalStones = aliceScore + bobScore;
+
+        int bobScore = (totalStones - aliceScore) / 2;
+
+
+        return totalStones - bobScore;
+
+    }
+
+    private int stoneGameII(int player, int i, int m, int[] piles) {
+        if (i >= piles.length) return 0;
+        Pair<Integer, Integer> cacheKey = new Pair<>(i, m);
+        if (cache.containsKey(cacheKey)) return cache.get(cacheKey);
+        int score = Integer.MIN_VALUE;
+
+        int maxReach = 2 * m;
+        int scoreSum = 0;
+        int nextPlayer = (player + 1) % 2;
+        int boundary = Math.min(i + maxReach, piles.length);
+        int x = 0;
+        for (int j = i; j < boundary; j++) {
+            scoreSum += piles[j];
+            x++;
+            int newM = Math.max(x, m);
+            int newStart = j + 1;
+            int finalScore = scoreSum - stoneGameII(nextPlayer, newStart, newM, piles);
+            score = Math.max(score, finalScore);
+        }
+
+        cache.put(cacheKey, score);
+        return score;
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class StoneGameIi extends Solution {
+}

src/leetcode/editor/en/Q837/New21Game.java

@@ -0,0 +1,40 @@
+package leetcode.editor.en.Q837;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+
+class Solution {
+
+
+    public double new21Game(int n, int k, int maxPts) {
+        double[] slidingWindow = new double[maxPts + k + 1];
+        double windowSum = 0;
+        for (int card = k; card < maxPts + k; card++) {
+            double prob = (card <= n) ? 1.0 : 0;
+            slidingWindow[card] = prob;
+            windowSum += prob;
+
+        }
+        for (int card = k - 1; card >= 0; card--) {
+            double prob = windowSum / maxPts;
+
+            slidingWindow[card] = prob;
+            windowSum += prob;
+            windowSum -= slidingWindow[card + maxPts];
+
+        }
+
+        return slidingWindow[0];
+
+    }
+
+
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class New21Game extends Solution {
+}