題目鏈接： LeetCode 64 — Minimum Path Sum
AC代碼：
public class PRoblem64 { public static void main(String[] args) { // TODO Auto-generated method stub } public int minPathSum(int[][] grid) { int m=grid.length; int n =grid[0].length; int[][] a=new int[m][n]; a[0][0]=grid[0][0]; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(i==0 && j==0) continue; int k1=9999,k2=9999; if(i!=0) k1=a[i-1][j]; if(j!=0) k2=a[i][j-1]; a[i][j]=k1<k2? grid[i][j]+k1 : grid[i][j]+k2; } } return a[m-1][n-1]; }}新聞熱點
疑難解答
