leetCode练习（63）

最新推荐文章于 2024-09-16 06:54:08 发布

碰碰猪

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量369

点赞数

分类专栏： leetCode 文章标签： leetcode java 动态规划

本文链接：https://blog.csdn.net/u010771890/article/details/52794440

版权

leetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目：Unique Paths II

难度：medium

问题描述：

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]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

解题思路：

leetCode练习（62）的拓展，多了一个是否为障碍的判断，难度基本不变，使用动态规划，很简单的一道题，具体代码如下：

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
		int m=obstacleGrid.length;
		int n=obstacleGrid[0].length;
        int[][] board=new int[m][n];       
        for(int i=m-1;i>=0;i--){
        	for(int j=n-1;j>=0;j--){
        		if(obstacleGrid[i][j]==1){
        			//是石头
        			board[i][j]=0;
        			continue;
        		}else{
        			if(i!=m-1&&j!=n-1){
        				board[i][j]=board[i][j+1]+board[i+1][j];
        			}else{
        				if(i==m-1){
        					if(j==n-1){
        						board[i][j]=1;
        						continue;
        					}
        					board[i][j]=board[i][j+1];
        				}else if(j==n-1){
        					board[i][j]=board[i+1][j];
        				}
        			}
        		}
        	}
        }
        return board[0][0];
    }