62. 不同路径
public static int uniquePaths(int m, int n) { int[][] path = new int[m][n]; for (int i = 0; i < m; i++) { path[i][0] = 1; } for (int i = 0; i < n; i++) { path[0][i] = 1; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { sumPath(path, i, j); } } return path[m - 1][n - 1]; } public static void sumPath(int[][] path, int m, int n) { path[m][n] = path[m][n - 1] + path[m - 1][n]; }