和最短路径差不多,更新第一行第一列
然后从第(1,1)遍历
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size(), n = obstacleGrid.at(0).size();
vector<vector<int>> f(m,vector<int>(n
和最短路径差不多,更新第一行第一列
然后从第(1,1)遍历
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size(), n = obstacleGrid.at(0).size();
vector<vector<int>> f(m,vector<int>(n