LeetCode动态规划专题：第十五天

思路总结

Leetcode62. 不同路径

思路：动态规划

初始化边界，将第一行和第一列方案数置为1，每一个格子只能从上面的格子或者左边的格子都过来，所以走到该格子的方案数就应该是两者之和

f[i][j] += f[i - 1][j] + f[i][j - 1];

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> f(m, vector<int>(n));
        for (int i = 0; i < m; i ++ ) f[i][0] = 1;
        for (int i = 0; i < n; i ++ ) f[0][i] = 1;

        for (int i = 1; i < m; i ++ )
            for (int j = 1; j < n; j ++ )
                f[i][j] += f[i - 1][j] + f[i][j - 1];
        
        return f[m - 1][n - 1];
    }
};

Leetcode63. 不同路径 II

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& g) {
        int n = g.size(), m = g[0].size();
        vector<vector<int>> f(n, vector<int>(m));

        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ )
                if (!g[i][j]) {
                    if (!i && !j) f[i][j] = 1;
                    else {
                        if (i) f[i][j] += f[i - 1][j];
                        if (j) f[i][j] += f[i][j - 1];
                    }
                }
        return f[n - 1][m - 1];
    }
};