package LeetCode;/**
* @Classname UniquePathsII
* @Description TODO
* @Date 19-2-28 上åˆ11:11
* @Created by mao
*/
public class UniquePathsII {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m=obstacleGrid.length;
int n=obstacleGrid[0].length;
int[][] path=new int[m][n];
if(m==1 || n==1){
return 1;
}
for(int i=0;i