Leetcode_unique-paths-ii

地址：http://oj.leetcode.com/problems/unique-paths-ii/

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

思路：对上一题( http://blog.csdn.net/flyupliu/article/details/21841039 )的修剪。

边界条件是第一行或者第一列。用的打表。具体可以揣摩代码。

参考代码

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        if(obstacleGrid.empty() || obstacleGrid[0][0]==1)
            return 0;
        int row = obstacleGrid.size();
        int col = obstacleGrid[0].size();
        if(obstacleGrid[row-1][col-1]==1)
            return 0;
        obstacleGrid[0][0] = 1;
        for(int i = 0; i < row; ++i)
        {
            for(int j = 0; j < col; ++j)
            {
                if((i||j) && obstacleGrid[i][j]==1)
                {
                    obstacleGrid[i][j]=0;
                    continue;
                }
                if(i==0 && j>0)
                {
                    obstacleGrid[i][j] = obstacleGrid[i][j-1];
                }
                else if(j==0 && i>0)
                {
                    obstacleGrid[i][j] = obstacleGrid[i-1][j];
                }
                else if(i>0 && j>0)
                {
                    obstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1];
                }
            }
        }
        return obstacleGrid[row-1][col-1];
    }
};

python:

 
 

  
  class 
  
  Solution
  
  :
 
 
 
 

  
      
  
  # @param obstacleGrid, a list of lists of integers
 
 
 
 

  
      
  
  # @return an integer
 
 
 
 

  
      
  
  def 
  
  uniquePathsWithObstacles
  
  (
  
  self
  
  , 
  
  obstacleGrid
  
  ):
 
 
 
 

  
          
  
  if 
  
  not 
  
  obstacleGrid
  
  :
 
 
 
 

  
              
  
  return 
  
  0
 
 
 
 

  
          
  
  row 
  
  = 
  
  len
  
  (
  
  obstacleGrid
  
  )
 
 
 
 

  
          
  
  col 
  
  = 
  
  len
  
  (
  
  obstacleGrid
  
  [
  
  0
  
  ])
 
 
 
 

  
          
  
  if 
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  0
  
  ] 
  
  or 
  
  obstacleGrid
  
  [
  
  row
  
  -
  
  1
  
  ][
  
  col
  
  -
  
  1
  
  ]:
 
 
 
 

  
              
  
  return 
  
  0
 
 
 
 

  
          
  
  for 
  
  i 
  
  in 
  
  range
  
  (
  
  0
  
  , 
  
  row
  
  ):
 
 
 
 

  
              
  
  if 
  
  not 
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  0
  
  ]:
 
 
 
 

  
                  
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  0
  
  ] 
  
  = 
  
  -
  
  1
 
 
 
 

  
              
  
  else
  
  :
 
 
 
 

  
                  
  
  break
 
 
 
 

  
          
  
  for 
  
  i 
  
  in 
  
  range
  
  (
  
  1
  
  , 
  
  col
  
  ):
 
 
 
 

  
              
  
  if 
  
  not 
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  i
  
  ]:
 
 
 
 

  
                  
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  i
  
  ] 
  
  = 
  
  -
  
  1
 
 
 
 

  
              
  
  else
  
  :
 
 
 
 

  
                  
  
  break
 
 
 
 

  
          
  
  for 
  
  i 
  
  in 
  
  range
  
  (
  
  1
  
  , 
  
  row
  
  ):
 
 
 
 

  
              
  
  for 
  
  j 
  
  in 
  
  range
  
  (
  
  1
  
  , 
  
  col
  
  ):
 
 
 
 

  
                  
  
  if 
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  ]:
 
 
 
 

  
                      
  
  continue
 
 
 
 

  
                  
  
  if 
  
  obstacleGrid
  
  [
  
  i
  
  -
  
  1
  
  ][
  
  j
  
  ] 
  
  < 
  
  0
  
  :
 
 
 
 

  
                      
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  ] 
  
  += 
  
  obstacleGrid
  
  [
  
  i
  
  -
  
  1
  
  ][
  
  j
  
  ]
 
 
 
 

  
                  
  
  if 
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  -
  
  1
  
  ] 
  
  < 
  
  0
  
  :
 
 
 
 

  
                      
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  ] 
  
  += 
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  -
  
  1
  
  ]
 
 
 
 

  
          
  
  return 
  
  -
  
  obstacleGrid
  
  [
  
  row
  
  -
  
  1
  
  ][
  
  col
  
  -
  
  1
  
  ]
 
 

 
 

  
  //SECOND TRIAL
 
 
 
 

  
  class 
  
  Solution 
  
  {
 
 
 
 

  
  public
  
  :
 
 
 
 

  
      
  
  int 
  
  uniquePathsWithObstacles
  
  (
  
  vector
  
  <
  
  vector
  
  <
  
  int
  
  > 
  
  > 
  
  &
  
  obstacleGrid
  
  ) 
  
  {
 
 
 
 

  
          
  
  if
  
  (
  
  obstacleGrid
  
  .
  
  empty
  
  () 
  
  || 
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  0
  
  ])
 
 
 
 

  
              
  
  return 
  
  0
  
  ;
 
 
 
 

  
          
  
  int 
  
  row 
  
  = 
  
  obstacleGrid
  
  .
  
  size
  
  (), 
  
  col 
  
  = 
  
  obstacleGrid
  
  [
  
  0
  
  ].
  
  size
  
  ();
 
 
 
 

  
          
  
  if
  
  (
  
  obstacleGrid
  
  [
  
  row
  
  -
  
  1
  
  ][
  
  col
  
  -
  
  1
  
  ])
 
 
 
 

  
              
  
  return 
  
  0
  
  ;
 
 
 
 

  
          
  
  for
  
  (
  
  int 
  
  i 
  
  = 
  
  0
  
  ; 
  
  i
  
  <
  
  row
  
  ; 
  
  ++
  
  i
  
  )
 
 
 
 

  
          
  
  {
 
 
 
 

  
              
  
  if
  
  (
  
  !
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  0
  
  ])
 
 
 
 

  
                  
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  0
  
  ] 
  
  = 
  
  -
  
  1
  
  ;
 
 
 
 

  
              
  
  else
 
 
 
 

  
                  
  
  break
  
  ;
 
 
 
 

  
          
  
  }
 
 
 
 

  
          
  
  for
  
  (
  
  int 
  
  i 
  
  = 
  
  1
  
  ; 
  
  i
  
  <
  
  col
  
  ; 
  
  ++
  
  i
  
  )
 
 
 
 

  
          
  
  {
 
 
 
 

  
              
  
  if
  
  (
  
  !
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  i
  
  ])
 
 
 
 

  
                  
  
  obstacleGrid
  
  [
  
  0
  
  ][
  
  i
  
  ] 
  
  = 
  
  -
  
  1
  
  ;
 
 
 
 

  
              
  
  else
 
 
 
 

  
                  
  
  break
  
  ;
 
 
 
 

  
          
  
  }
 
 
 
 

  
          
  
  for
  
  (
  
  int 
  
  i 
  
  = 
  
  1
  
  ; 
  
  i
  
  <
  
  row
  
  ; 
  
  ++
  
  i
  
  )
 
 
 
 

  
          
  
  {
 
 
 
 

  
              
  
  for
  
  (
  
  int 
  
  j 
  
  = 
  
  1
  
  ; 
  
  j
  
  <
  
  col
  
  ; 
  
  ++
  
  j
  
  )
 
 
 
 

  
              
  
  {
 
 
 
 

  
                  
  
  if
  
  (
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  ])
 
 
 
 

  
                      
  
  continue
  
  ;
 
 
 
 

  
                  
  
  if
  
  (
  
  obstacleGrid
  
  [
  
  i
  
  -
  
  1
  
  ][
  
  j
  
  ]
  
  <
  
  0
  
  )
 
 
 
 

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

  
                  
  
  if
  
  (
  
  obstacleGrid
  
  [
  
  i
  
  ][
  
  j
  
  -
  
  1
  
  ]
  
  <
  
  0
  
  )
 
 
 
 

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

  
              
  
  }
 
 
 
 

  
          
  
  }
 
 
 
 

  
          
  
  return 
  
  -
  
  obstacleGrid
  
  [
  
  row
  
  -
  
  1
  
  ][
  
  col
  
  -
  
  1
  
  ];
 
 
 
 

  
      
  
  }
 
 
 
 

  
  };