第一种方法:
public class Solution {
public int UniquePathsWithObstacles(int[][] obstacleGrid) {
int m=obstacleGrid.Length;
int n=obstacleGrid[0].Length;
int[] dp=new int[n];
//判定dp数组的初始化状态
dp[0]=obstacleGrid[0][0]==0?1:0;
//遍历方向 由上到下 由左到右 从0开始
for(int i=0;i<m;++i){
for(int j=0;j<n;++j){
if(obstacleGrid[i][j]==1){
dp[j]=0;
continue;
}
if(j-1>=0&&obstacleGrid[i][j]==0)
dp[j] +=dp[j-1];
}
}
return dp[n-1];
}
}
第二种:
public class Solution {
public int UniquePathsWithObstacles(int[][] obstacleGrid) {
int m=obstacleGrid.GetLength(0);
int n=obstacleGrid[0].Length;
int[,] dp=new int[m,n];
for(int i=0;i&l