/
CherryPickup2.java
77 lines (64 loc) · 2.2 KB
/
CherryPickup2.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
class Solution {
public int cherryPickup(int[][] grid) {
int n = grid.length, m = grid[0].length;
int[][][] dp = new int[n + 1][m][m];
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < m/2; j++) {
for (int k = 0; k < m/2; k++) {
int sum = grid[i][j] + (j == k ? 0 : grid[i][k]);
int max = j == 0 || k == 0 ? 0 : dp[i + 1][j - 1][k - 1];
dp[i][j][k] = max + sum;
}
}
for (int j = m/2; j < m; j++) {
for (int k = m/2; k < m; k++) {
int sum = grid[i][j] + (j == k ? 0 : grid[i][k]);
int max = j == m - 1 || k == m - 1 ? 0 : dp[i + 1][j + 1][k + 1];
dp[i][j][k] = max + sum;
}
}
for (int j = 0; j < m; j++) {
for (int k = 0; k < m; k++) {
int sum = grid[i][j] + (j == k ? 0 : grid[i][k]);
int max = 0;
for (int x = -1; x <= 1; x++) {
if (j == 0 && x == -1) continue;
if (j == m - 1 && x == 1) continue;
for (int y = -1; y <= 1; y++) {
if (k == 0 && y == -1) continue;
if (k == m - 1 && y == 1) continue;
max = Math.max(max, dp[i + 1][j + x][k + y]);
}
}
dp[i][j][k] = max + sum;
}
}
}
return dp[0][0][m - 1];
}
int max(
int[][] grid,
int i,
int j, int k
) {
int n = grid.length;
int m = grid[0].length;
if (i >= n) {
return 0;
}
if (j < 0 || j >= m) {
return 0;
}
if (k < 0 || k >= m) {
return 0;
}
int sum = grid[i][j] + (j == k ? 0 : grid[i][k]);
int max = 0;
for (int x = -1; x <= 1; x++) {
for (int y = -1; y <= 1; y++) {
max = Math.max(max, max(grid, i + 1, j + x, k + y));
}
}
return max + sum;
}
}