切记:二维数组的初始值为0
gridArr[i][j] =gridArr[i][j] + gridArr[i-1][j];
class Solution {
public int uniquePaths(int m, int n) {
int[][] gridArr = new int[m][n];
// 1,定义初始状态
gridArr[0][0] = 1;
// 2,遍历网格
for(int i=0;i<m;i++) {
for(int j=0;j<n;j++) {
if (i-1 >=0 && i-1<m) {
gridArr[i][j] =gridArr[i][j] + gridArr[i-1][j];
}
if (j-1 >=0 && j-1<n) {
gridArr[i][j] =gridArr[i][j] + gridArr[i][j-1];
}
}
}
return gridArr[m-1][n-1];
}
}