210125

Author: aluferraz

leetcode/editor/en/Q2017/GridGame.py

@@ -0,0 +1,30 @@
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def gridGame(self, grid: List[List[int]]) -> int:
+        N = len(grid[0])
+        INF = 10 ** 20
+
+        presum_1 = [0] * N
+        presum_2 = [0] * N
+        presum_1[0] = grid[0][0]
+        presum_2[0] = grid[1][0]
+        for i in range(1, N):
+            presum_1[i] = presum_1[i - 1] + grid[0][i]
+            presum_2[i] = presum_2[i - 1] + grid[1][i]
+        best = INF
+        for j in range(N):
+            # if i go down here:
+            ans1 = presum_1[j] + (presum_2[-1] - (presum_2[j - 1] if j > 0 else 0))
+            ans2 = max((presum_2[j - 1] if j > 0 else 0), presum_1[-1] - presum_1[j])
+            best = min(best, ans2)
+        return best
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class GridGame(Solution):
+    pass

main.py

@@ -1,6 +1,5 @@
-from leetcode.editor.en.Q1368.MinimumCostToMakeAtLeastOneValidPathInAGrid import \
-    MinimumCostToMakeAtLeastOneValidPathInAGrid
+from leetcode.editor.en.Q2017.GridGame import GridGame
 
 if __name__ == '__main__':
     print(
-        MinimumCostToMakeAtLeastOneValidPathInAGrid().minCost([[1, 1, 1, 1], [2, 2, 2, 2], [1, 1, 1, 1], [2, 2, 2, 2]]))
+        GridGame().gridGame([[20, 3, 20, 17, 2, 12, 15, 17, 4, 15], [20, 10, 13, 14, 15, 5, 2, 3, 14, 3]]))