leetcode-----63. 不同路径 II

• 链接：https://leetcode-cn.com/problems/unique-paths-ii/

代码

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& o) {
        int n = o.size();
        if (!n) return 0;
        int m = o[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 (!o[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];
    }
};

leetcode-----63. 不同路径 II

原文：https://www.cnblogs.com/clown9804/p/13263249.html