63. 不同路径 II

稍微进阶一丢丢的机器人走方格

class Solution {
public:
    int uniquePathsWithObstacles(vector>& matrix) {
	int row = matrix.size();
	int cal = matrix[0].size();
	vector>dp(row,vector(cal,0));
	if(matrix[0][0]==0)
		dp[0][0]=1;

	for(int i=0;i=0?dp[i-1][j]:0;
				int left = j-1>=0?dp[i][j-1]:0;
				dp[i][j] = up+left;
			}
		}
	}
	return dp[row-1][cal-1];


    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25