面试题47：礼物的最大价值-动态规划

题目描述

面试题47：在一个 m*n 的棋盘的每一格都放有一个礼物，每个礼物都有一定的价值（价值大于 0）。你可以从棋盘的左上角开始拿格子里的礼物，并每次向右或者向下移动一格、直到到达棋盘的右下角。给定一个棋盘及其上面的礼物的价值，请计算你最多能拿到多少价值的礼物？

思路分析

dp[i][j]=max(d[i−1][j],d[i][j−1])+grid[i][j]

初始值：
dp[0][0] = grid[0][0]

边界条件：
dp[i][0] = dp[i-1][0] + grid[i][0]
dp[0][j] = dp[0][j-1] + grid[0][j]

#if 0

class Solution {
public:
    int maxValue(vector<vector<int>>& grid) {
    	if(grid.empty() || grid[0].empty())
    		return 0;
    	int m = grid.size(), n = grid[0].size(), i, j;
    	vector<vector<int>> dp(m, vector<int>(n,0));
    	dp[0][0] = grid[0][0];  //初始化
    	for(j = 1; j < n; j++)  //边界条件
    		dp[0][j] = dp[0][j-1] + grid[0][j];
    	for(i = 1; i < m; ++i)  //边界条件
    		dp[i][0] = dp[i-1][0] + grid[i][0];
    	for(i = 1; i < m; ++i)  //转移方程
    		for(j = 1; j < n; j++)
    			dp[i][j] = grid[i][j] + max(dp[i][j-1], dp[i-1][j]);
		return dp[m-1][n-1];
    }
};    

#elif 1

class Solution {
public:
    int maxValue(vector<vector<int>>& grid) {
            if(grid.empty() || grid[0].empty())
    		    return 0;
            int row = grid.size(), col = grid[0].size();
            
            int** dp = new int* [row];  //开二维数组
            for(int i = 0; i < col; ++i)
                dp[i] = new int [col];

            for(int i = 0; i < row; i++){   //计算顺序，逐行
                for(int j = 0; j < col; j++){ 
                    int left = 0, up = 0;    //初始化放在循环里面，此处相当于声明dp[0][0] =0   
                    if(i > 0)
                            up = dp[i - 1][j];
                    if(j > 0)
                        left = dp[i][j - 1];            
                    dp[i][j] = max(up, left) + grid[i][j];   //转移方程          
                }
            }
            int maxValue =  dp[row-1][col-1];
            for(int i = 0; i < row; ++i)    //释放空间
                delete[] dp[i];     //回收低一级动态数组
            delete[] dp;    //回收高一级动态数组
		  return maxValue;       
        }
    };

#endif

20210929

class Solution
{
public:
    int maxValue(vector<vector<int>> &grid)
    {
        vector<int>::size_type m = grid.size();
        vector<int>::size_type n = grid[0].size();
        vector<vector<int> > dp(m, vector<int>(n, 0));
        
        dp[0][0] = grid[0][0]; // 初始条件

        for (vector<int>::size_type i = 1; i < m; i++) { // 边界1
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }
        for (vector<int>::size_type j = 1; j < n; j++) { // 边界2
            dp[0][j] = dp[0][j - 1] + grid[0][j];
        }

        for (vector<int>::size_type i = 1; i < m; i++) { 
            for (vector<int>::size_type j = 1; j < n; j++) {
                dp[i][j] = max(grid[i][j] + dp[i - 1][j], grid[i][j] + dp[i][j - 1]);
            }
        }

        return dp[m - 1][n - 1];
    }
};

**************************************************************
class Solution {
public:
    int maxValue(vector<vector<int>> &grid)
    {
        grid[0][0] = grid[0][0];

        vector<int>::size_type m = grid.size();
        vector<int>::size_type n = grid[0].size();
        for (vector<int>::size_type i = 1; i < m; i++) {
            grid[i][0] += grid[i - 1][0];
        }
        for (vector<int>::size_type j = 1; j < n; j++) {
            grid[0][j] += grid[0][j - 1];
        }

        for (vector<int>::size_type i = 1; i < m; i++) {
            for (vector<int>::size_type j = 1; j < n; j++) {
                grid[i][j] = max(grid[i][j] + grid[i - 1][j], grid[i][j] + grid[i][j - 1]);
            }
        }

        return grid[m - 1][n - 1];
    }
};