Java——力扣64.最小路径和

package practices;

import java.util.Scanner;
public class Binary_Tree {
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int m=s.nextInt();
		int n=s.nextInt();
		int [][] grid=new int[m][n];
		System.out.println("请输入:");
		for(int i=0;i<m;i++)
		{
			for(int j=0;j<n;j++)
			{
				grid[i][j]=s.nextInt();
			}
		}
		int ss=minPathSum(grid,m,n);
		System.out.println("最小路径和为:"+ss);
	}
	
	
	public static int minPathSum(int[][] grid,int m,int n) 
	{
	    for(int i = 0; i <m; i++) 
	    {
	        for(int j = 0; j < n; j++) 
	        {
	            if(i == 0 && j == 0) continue;
	            else if(i == 0)  grid[i][j] = grid[i][j - 1] + grid[i][j];
	            else if(j == 0)  grid[i][j] = grid[i - 1][j] + grid[i][j];
	            else grid[i][j] = Math.min(grid[i - 1][j], grid[i][j - 1]) + grid[i][j];
	        }
	    }
	    return grid[m - 1][n - 1];
	}
}