Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public int minPathSum(int[][] grid) {
- int n = grid.length;
- int m = grid[0].length;
- int[][] dp = new int[n][m];
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- if (i == 0 && j == 0) {
- dp[i][j] = grid[i][j];
- } else if (i == 0) {
- dp[i][j] = grid[i][j] + dp[i][j - 1];
- } else if (j == 0) {
- dp[i][j] = grid[i][j] + dp[i - 1][j];
- } else {
- dp[i][j] = grid[i][j] + Math.min(dp[i - 1][j], dp[i][j - 1]);
- }
- }
- }
- return dp[n - 1][m - 1];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement