We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 69c9483 commit d6a081aCopy full SHA for d6a081a
scripts/algorithms/G/Grid Game/Grid Game.java
@@ -1,25 +1,27 @@
1
+// Runtime: 11 ms (Top 40.95%) | Memory: 94.7 MB (Top 51.18%)
2
+
3
class Solution {
4
public long gridGame(int[][] grid) {
5
int n = grid[0].length;
6
long preRow1[] = new long[n];
7
long preRow2[] = new long[n];
-
8
9
preRow1[0] = grid[0][0];
10
preRow2[0] = grid[1][0];
11
12
for(int i = 1;i<n;i++){
13
preRow1[i] += (long)preRow1[i-1] + (long)grid[0][i];
14
preRow2[i] += (long)preRow2[i-1] + (long)grid[1][i];
15
}
16
17
long res = Long.MAX_VALUE;
18
for(int i = 0;i<n;i++){
19
long top = preRow1[n-1] - preRow1[i];
20
long bottom = i == 0 ? 0 : preRow2[i-1];
21
long temp = Math.max(top,bottom);
22
res = Math.min(res,temp);
23
24
25
return res;
26
-}
27
+}
0 commit comments