feat: add java solution to lc problem: No.0877.Stone Game

solution/0800-0899/0877.Stone Game/README.md

@@ -59,7 +59,21 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+        public boolean stoneGame(int[] ps) {
+        int n = ps.length;
+        int[][] f = new int[n + 2][n + 2]; 
+        for (int len = 1; len <= n; len++) {
+            for (int l = 1; l + len - 1 <= n; l++) {
+                int r = l + len - 1;
+                int a = ps[l - 1] - f[l + 1][r];
+                int b = ps[r - 1] - f[l][r - 1];
+                f[l][r] = Math.max(a, b);
+            }
+        }
+        return f[1][n] > 0;
+    }   
+}
 ```
 
 ### **...**

solution/0800-0899/0877.Stone Game/README_EN.md

@@ -50,7 +50,21 @@ This demonstrated that taking the first 5 was a winning move for Alex, so we ret
 ### **Java**
 
 ```java
-
+class Solution {
+        public boolean stoneGame(int[] ps) {
+        int n = ps.length;
+        int[][] f = new int[n + 2][n + 2]; 
+        for (int len = 1; len <= n; len++) {
+            for (int l = 1; l + len - 1 <= n; l++) {
+                int r = l + len - 1;
+                int a = ps[l - 1] - f[l + 1][r];
+                int b = ps[r - 1] - f[l][r - 1];
+                f[l][r] = Math.max(a, b);
+            }
+        }
+        return f[1][n] > 0;
+    }   
+}
 ```
 
 ### **...**

solution/0800-0899/0877.Stone Game/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+        public boolean stoneGame(int[] ps) {
+        int n = ps.length;
+        int[][] f = new int[n + 2][n + 2];
+        for (int len = 1; len <= n; len++) {
+            for (int l = 1; l + len - 1 <= n; l++) {
+                int r = l + len - 1;
+                int a = ps[l - 1] - f[l + 1][r];
+                int b = ps[r - 1] - f[l][r - 1];
+                f[l][r] = Math.max(a, b);
+            }
+        }
+        return f[1][n] > 0;
+    }
+}