Leetcode 63

//一维dp还是比较难写的
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid[].size();
        int n = obstacleGrid.size();
        vector<int> dp(m,);
        for(int j=;j < m;j++){
            if(obstacleGrid[][j] == ){
                for(int i=j;i < m;i++)
                    dp[i] = ;
                break;
            }
        }
        for(int i=;i < n;i++){
            if(obstacleGrid[i][] == ){
                    dp[] = ;
            }
            for(int j=;j < m;j++){
                dp[j] = dp[j] + dp[j-];
                if(obstacleGrid[i][j] == ){
                    dp[j] = ;
                }
            }
        }

        return dp[m-];

    }
};