美文网首页
Dynamic Programming 2:Unique Pat

Dynamic Programming 2:Unique Pat

作者: babyachievement | 来源:发表于2018-06-21 18:35 被阅读0次

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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

image

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

Note: m and n will be at most 100.

Example 1:

Input: [
[0,0,0],
[0,1,0],
[0,0,0]
]
Output: 2
Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:

  1. Right -> Right -> Down -> Down
  2. Down -> Down -> Right -> Right
IMG_20180621_183323.jpg
    public int uniquePathsWithObstacles2(int[][] obstacleGrid) {
        if(obstacleGrid==null||obstacleGrid.length==0)
            return 0;

        for(int i=0;i<obstacleGrid.length;i++)
            for(int j=0;j<obstacleGrid[0].length;j++)
            {
                if(i==0)
                {
                    if(j==0)
                        obstacleGrid[0][0] = 1 - obstacleGrid[0][0];
                    else
                        obstacleGrid[0][j] = obstacleGrid[0][j]==1?0:obstacleGrid[0][j-1];
                }
                else
                {
                    if(j==0)
                        obstacleGrid[i][0] = obstacleGrid[i][0]==1?0:obstacleGrid[i-1][0];
                    else
                        obstacleGrid[i][j] = obstacleGrid[i][j]==1?0:(obstacleGrid[i-1][j]+obstacleGrid[i][j-1]);
                }
            }
        return obstacleGrid[obstacleGrid.length-1][obstacleGrid[0].length-1];
    }

相关文章

网友评论

      本文标题:Dynamic Programming 2:Unique Pat

      本文链接:https://www.haomeiwen.com/subject/hzycyftx.html