add 2017

fishercoder1534 · fishercoder1534 · commit b17f772dd424 · 2021-09-29T10:10:45.000-07:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
 |2018|[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) ||Medium||
+|2017|[Grid Game](https://leetcode.com/problems/grid-game/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) ||Medium|Array, Matrix, Prefix Sum|
 |2016|[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) ||Easy||
 |2012|[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2012.java) ||Medium||
 |2011|[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2011.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2017.java b/src/main/java/com/fishercoder/solutions/_2017.java
@@ -0,0 +1,23 @@
+package com.fishercoder.solutions;
+
+public class _2017 {
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/uwi/
+         */
+        public long gridGame(int[][] grid) {
+            int n = grid[0].length;
+            long[] cum0 = new long[n + 1];
+            long[] cum1 = new long[n + 1];
+            for (int i = 0; i < n; i++) {
+                cum0[i + 1] = cum0[i] + grid[0][i];
+                cum1[i + 1] = cum1[i] + grid[1][i];
+            }
+            long ans = Long.MAX_VALUE;
+            for (int i = 0; i < n; i++) {
+                ans = Math.min(ans, Math.max(cum0[n] - cum0[i + 1], cum1[i]));
+            }
+            return ans;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2017Test.java b/src/test/java/com/fishercoder/_2017Test.java
@@ -0,0 +1,45 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1;
+import com.fishercoder.solutions._2017;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class _2017Test {
+    private static _2017.Solution1 solution1;
+    private static int[][] grid;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2017.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        grid = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[2,5,4],[1,5,1]");
+        assertEquals(4, solution1.gridGame(grid));
+    }
+
+    @Test
+    public void test2() {
+        grid = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[3,3,1],[8,5,2]");
+        assertEquals(4, solution1.gridGame(grid));
+    }
+
+    @Test
+    public void test3() {
+        grid = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,3,1,15],[1,3,3,1]");
+        assertEquals(7, solution1.gridGame(grid));
+    }
+
+    @Test
+    public void test4() {
+        grid = CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[20,3,20,17,2,12,15,17,4,15],[20,10,13,14,15,5,2,3,14,3]");
+        assertEquals(63, solution1.gridGame(grid));
+    }
+
+}
