动态规划

动态规划问题：

/*
 * @lc app=leetcode.cn id=63 lang=cpp
 *
 * [63] 不同路径 II
 */

// @lc code=start
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        if (obstacleGrid[0][0] == 1) {
            return 0;
        }
        vector<vector<int> > dp(m, vector<int>(n, 0));
        bool ob_row = false;
        for (int i = 0; i < m; i++) {
            if (obstacleGrid[i][0] == 0 && !ob_row) {
                dp[i][0] = 1;
            } else {
                dp[i][0] = 0;
                ob_row = true;
            }
        }
        bool ob_col = false;
        for (int i = 0; i < n; i++) {
            if (obstacleGrid[0][i] == 0 && !ob_col) {
                dp[0][i] = 1;
            } else {
                dp[0][i] = 0;
                ob_col = true;
            }
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (obstacleGrid[i][j] == 1) {
                    dp[i][j] = 0;
                } else {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
};
// @lc code=end

1 确定dp[i][j]的具体意义

2 讨论状态，怎么来的

 

最小路径和同样的道理，可以看到代码的结构几乎一致

/*
 * @lc app=leetcode.cn id=64 lang=cpp
 *
 * [64] 最小路径和
 */

// @lc code=start
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<vector<int> >dp(m, vector<int>(n, 0));

        dp[0][0] = grid[0][0];
        for (int i = 1; i < m; i++) { //notice 1
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }
        for (int i = 1; i < n; i++) {
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1;j < n; j++) {
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }
        return dp[m - 1][n - 1];
    }
};
// @lc code=end

打家劫舍问题，最重要的是对状态的讨论，还有边界问题

/*
 * @lc app=leetcode.cn id=213 lang=cpp
 *
 * [213] 打家劫舍 II
 */

// @lc code=start
class Solution {
public:
    int rob(vector<int>& nums) {
        int l = nums.size();
        if (l == 0) return 0;
        if (l == 1) return nums[0];
        if (l == 2) return max(nums[0], nums[1]);
        vector<int> dp1(l, 0);
        vector<int> dp2(l, 0);

        //steal the last, the first do'nt steal, the 
        dp1[0] = 0; dp1[1] = nums[1];
        for (int i = 2; i < l - 2; i++) {
            dp1[i] = max(dp1[i - 2] + nums[i], dp1[i - 1]);    
        }
        dp1[l - 1] = dp1[l - 3] + nums[l - 1];

        //not steal the last 
        dp2[0] = nums[0]; dp2[1] = max(nums[0], nums[1]);
        for (int i = 2; i < l - 1; i++) {
            dp2[i] = max(dp2[i - 2] + nums[i], dp2[i - 1]);
        }
        dp2[l -1] = dp2[l - 2];

        return max(dp1[l - 1], dp2[l - 1]);
    }
};
// @lc code=end