LeetCode题解之Unique Paths II

1、题目描述

2、问题描述

使用动态规划算法，加上条件检测即可

3、代码

 int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
         int m = obstacleGrid.size() ;
         int n = obstacleGrid[].size() ;

         vector<vector<int>> sum(m , vector<int>(n, ));
         bool isOb = false;
         for( int i = ; i < m; i++){
             if( obstacleGrid[i][] == ) isOb = true;
             if( isOb ){
                 sum[i][] = ;
             }
             else{
                 sum[i][] = ;
             }
         }

         isOb = false;
         for(int j = ; j < n; j++){
             if( obstacleGrid[][j] == ) isOb = true;
             if( isOb ){
                 sum[][j] = ;
             }
             else{
                 sum[][j] = ;
             }
         }

         for(int i = ; i < m; i++){
             for( int j = ; j < n; j++){
                 if( obstacleGrid[i][j] == )
                     sum[i][j] == ;
                 else
                     sum[i][j]  = sum[i-][j] + sum[i][j-];
             }
         }

         return sum[m-][n-];
     }