LeetCode 64 --- Minimum Path Sum
2017-02-19 20:59
549 查看
题目链接：
LeetCode 64 — Minimum Path Sum
AC代码：
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]
;
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];
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 64 c语言. Minimum Path Sum
- Leetcode 64 Minimum Path Sum
- leetcode[64]Minimum Path Sum
- 【leetcode】【64】Minimum Path Sum
- leetcode_question_64 Minimum Path Sum
- 【python】【leetcode】【算法题目64—Minimum Path Sum】
- [LeetCode]64 Minimum Path Sum
- 【leetcode】Array—— Minimum Path Sum（64）
- Leetcode 64(Minimum Path Sum)
- 【LeetCode】C# 64、Minimum Path Sum
- LeetCode 64 Minimum Path Sum（Python详解及代码实现）
- (LeetCode 64)Minimum Path Sum
- leetcode-64-Minimum Path Sum 动态规划
- LeetCode64——Minimum Path Sum
- Leetcode64 Minimum Path Sum
- LeetCode - 62/63/64 - Unique Paths/Minimum Path Sum
- 【LEETCODE】64-Minimum Path Sum
- [Leetcode] #64 Minimum Path Sum
- LeetCode64 Minimum Path Sum
- [Leetcode 64, Medium] Minimum Path Sum