leetcode 741. Cherry Pickup_int dp(int x1, int y1, int x2, int y2) { if (x1

本文链接：https://blog.csdn.net/cmy203/article/details/99732215

本文介绍了一个基于动态规划算法解决的樱桃收集游戏问题。玩家在一个NxN的网格中，从起点(0,0)出发，通过合法路径到达终点(N-1,N-1)，并返回起点，目标是收集尽可能多的樱桃。文章详细解释了游戏规则，包括如何避免障碍物和重复路径，并提供了一个使用三维数组进行状态存储的高效解法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In a N x N grid representing a field of cherries, each cell is one of three possible integers.

0 means the cell is empty, so you can pass through;
1 means the cell contains a cherry, that you can pick up and pass through;
-1 means the cell contains a thorn that blocks your way.

Your task is to collect maximum number of cherries possible by following the rules below:

Starting at the position (0, 0) and reaching (N-1, N-1) by moving right or down through valid path cells (cells with value 0 or 1);
After reaching (N-1, N-1), returning to (0, 0) by moving left or up through valid path cells;
When passing through a path cell containing a cherry, you pick it up and the cell becomes an empty cell (0);
If there is no valid path between (0, 0) and (N-1, N-1), then no cherries can be collected.

Example 1:

Input: grid =
[[0, 1, -1],
 [1, 0, -1],
 [1, 1,  1]]
Output: 5
Explanation: 
The player started at (0, 0) and went down, down, right right to reach (2, 2).
4 cherries were picked up during this single trip, and the matrix becomes [[0,1,-1],[0,0,-1],[0,0,0]].
Then, the player went left, up, up, left to return home, picking up one more cherry.
The total number of cherries picked up is 5, and this is the maximum possible.

Note:

grid is an N by N 2D array, with 1 <= N <= 50.
Each grid[i][j] is an integer in the set {-1, 0, 1}.
It is guaranteed that grid[0][0] and grid[N-1][N-1] are not -1.

参考花花酱的解法

class Solution {
public:
    int cherryPickup(vector<vector<int>>& grid) 
    {
        int n = grid.size() ;
        cherry = vector<vector<vector<int>>>(n , vector<vector<int>>(n , vector<int>(n , INT_MIN))) ;
        cherry[0][0][0] = grid[0][0] ;
        return max( 0 , dp(n - 1 , n - 1 , n - 1 , grid)) ;
    }
    
    int dp(int x1 , int y1 , int x2 , vector<vector<int>>& grid)
    {
        int y2 = x1 + y1 - x2 ;
        if(x1 < 0 || y1 < 0 || x2 < 0 || y2 < 0) return -1 ;
        if(grid[x1][y1] < 0 || grid[x2][y2] < 0) return cherry[x1][y1][x2] = -1 ;        
        if(cherry[x1][y1][x2] != INT_MIN) return cherry[x1][y1][x2] ;
        
        int ans = max(max(dp(x1 - 1 , y1 , x2 , grid) , dp(x1 , y1 - 1 , x2 , grid)) , max(dp(x1 - 1 , y1 , x2 - 1 , grid) , dp(x1 , y1 - 1 , x2 - 1 , grid))) ;
        
        if(ans < 0) return cherry[x1][y1][x2] = -1 ;
        
        cherry[x1][y1][x2] = grid[x1][y1] + ans + (x1 != x2 ? grid[x2][y2] : 0) ;
        
        return cherry[x1][y1][x2] ;
    }
    
private :
    
    vector<vector<vector<int>>> cherry ;
};