leetcode JAVA Minimum Path Sum 难度系数3 3.22

Question：

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

public class Solution {   public int minPathSum(int[][] grid) {if (grid.length < 1)return 0;int row = grid.length;int column = grid[0].length;int[][] dp = new int[grid.length][grid[0].length];dp[0][0] = grid[0][0];for (int i = 1; i < row; i++) {dp[i][0] = dp[i - 1][0] + grid[i][0];}for (int j = 1; j < column; j++) {dp[0][j] = dp[0][j - 1] + grid[0][j];}for (int i = 1; i < row; i++) {for (int j = 1; j < column; j++) {dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];}}return dp[row - 1][column - 1];}}