64. Minimum Path Sum

DP

class Solution {
    public int minPathSum(int[][] grid) {
        int row = grid.length;
        int col = grid[0].length;
        int[] dp = new int[col];
        dp[0]=grid[0][0];
        for(int j = 1;j

你可能感兴趣的:(64. Minimum Path Sum)