算法分析与设计——LeetCode Problem.258 Add Digits

问题详情

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

Example 1:

[[1,3,1],
 [1,5,1],
 [4,2,1]]

Given the above grid map, return 7. Because the path 1→3→1→1→1 minimizes the sum.

---

问题分析及思路

此题考查算法中的动态规划，递推式为sum[i][j] = grid[i][j] + min(sum[i-1][j], sum[i][j-1]).

---

具体代码

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int row = grid.size();
        int col = grid[0].size();
        if (row == 0 && col == 0) return 0;
        vector<vector<int>> sum(grid);
        //int sum[row][col];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                sum[i][j] = 0;
            }
        }
        sum[0][0] = grid[0][0];
        for (int i = 1; i < row; i++) {
            sum[i][0] = grid[i][0] + sum[i - 1][0];
        }
        for (int i = 1; i < col; i++) {
            sum[0][i] = grid[0][i] + sum[0][i - 1];
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                sum[i][j] = grid[i][j] + min(sum[i - 1][j], sum[i][j - 1]);
            }
        }
        return sum[row - 1][col - 1];
    }
};