Leetcode:741. Cherry Pickup

最新推荐文章于 2022-05-15 21:43:14 发布

lyy_g

最新推荐文章于 2022-05-15 21:43:14 发布

阅读量658

点赞数

分类专栏： leetcode 文章标签： leetcode class

本文链接：https://blog.csdn.net/lyy_g/article/details/78768389

版权

leetcode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

c++code:

class Solution {
public:
int cherryPickup(vector<vector<int>>& grid) {
    int n = grid.size();
    int maxK = 2 * n - 1;
    int dp[maxK][n][n] = {-1};
    memset(dp, -1, sizeof(dp));
    for(int k = 0; k < maxK; k++) {
        for(int xa = 0; xa < n && xa <= k; xa++) {
            for(int xb = xa; xb < n && xb <= k; xb++) {
                if(grid[xa][k - xa] == -1 || grid[xb][k - xb] == -1) continue;
                int tmp = 0;
                if(k > 0) {
                    tmp = dp[k - 1][xa][xb];
                    if(xb > 0) tmp = max(tmp, dp[k - 1][xa][xb - 1]);
                    if(xa > 0) tmp = max(tmp, dp[k - 1][xa - 1][xb]);
                    if(xa > 0 && xb > 0) tmp = max(tmp, dp[k - 1][xa - 1][xb - 1]);
                }

                if(tmp < 0) continue;
                tmp += (xa == xb) ? grid[xa][k - xa] : grid[xa][k - xa] + grid[xb][k - xb];
                dp[k][xa][xb] = tmp;
                //cout<<k<<" "<<xa<<" "<<xb<<" "<<dp[k][xa][xb]<<endl;
            }
        }
    }

    return dp[maxK - 1][n - 1][n - 1] > 0 ? dp[maxK - 1][n - 1][n - 1] : 0;
}
};