Leetcode 741
class Solution:
"""
1. 来回最大等同于两个人同时摘
2. dp[i][j][k]表示第1个人位于(i,j),第二个人位于(k,i+j-k)的时候的最大樱桃数量。
3.最开始dp[i][j][k]=-1表示可达性未知,而如果有dp[?][?][?]可以到达dp[i][j][k],那么表示其是可达的。
而第0行和第0列的都不能计算在内,除非是两个人最开始由(0,1)和(1,0)到达(1,1)
"""
def cherryPickup(self, grid: List[List[int]]) -> int:
for i in range(len(grid)):
grid[i].insert(0, 0)
grid.insert(0, [0] * len(grid[0]))
n = len(grid)
next_step = [(1, 0, 1), (1, 0, 0), (0, 1, 0), (0, 1, 1)]
dp = [[[0] * n for i in range(n)] for j in range(n)]
for i in range(1, n):
for j in range(1, n):
for k in range(1, n):
dp[i][j][k] = -1
if not (1 <= i + j - k < n): continue
if grid[k][i + j - k] < 0 or grid[i][j] < 0: continue
for x1, y1, x2 in next_step:
if (i - x1 == 0 and j - y1 > 1) or (j - y1 == 0 and i - x1 > 1) or k - x2 == 0: continue
dp[i][j][k] = max(dp[i - x1][j - y1][k - x2], dp[i][j][k])
if dp[i][j][k] < 0: continue
dp[i][j][k] += grid[i][j] + grid[k][i + j - k]
if grid[i][j] and grid[k][i + j - k]:
dp[i][j][k] -= (i == k)
return max(dp[n - 1][n - 1][n - 1], 0)
LeetCode 927
"""
思路:最后的三组数必然是三个1作为起点,长度未知的数。长度在[1,n/3]内
s1,s2