public static long test(int[][] nums) { int m = nums.length; int n = nums[0].length; long[][] dp = new long[m][n]; for (int i = 0; i < m; i++) { if (nums[i][0] == 1) { break; } dp[i][0] = 1; } for (int i = 0; i < n; i++) { if (nums[0][i] == 1) { break; } dp[0][i] = 1; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { if (nums[i][j] == 0) { dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; } } } return dp[m - 1][n - 1]; } 家人为啥 33% 救命