-
Notifications
You must be signed in to change notification settings - Fork 0
/
64.最小路径和.java
52 lines (49 loc) · 1.25 KB
/
64.最小路径和.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*
* @lc app=leetcode.cn id=64 lang=java
*
* [64] 最小路径和
*
* https://leetcode-cn.com/problems/minimum-path-sum/description/
*
* algorithms
* Medium (64.80%)
* Likes: 398
* Dislikes: 0
* Total Accepted: 63.1K
* Total Submissions: 97.4K
* Testcase Example: '[[1,3,1],[1,5,1],[4,2,1]]'
*
* 给定一个包含非负整数的 m x n 网格,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
*
* 说明:每次只能向下或者向右移动一步。
*
* 示例:
*
* 输入:
* [
* [1,3,1],
* [1,5,1],
* [4,2,1]
* ]
* 输出: 7
* 解释: 因为路径 1→3→1→1→1 的总和最小。
*
*/
// @lc code=start
class Solution {
public int minPathSum(int[][] grid) {
int len = grid[0].length;
int width = grid.length;
for(int i = 1; i < len; i++)
grid[0][i] += grid[0][i-1];
for(int j = 1; j < width; j++)
grid[j][0] += grid[j-1][0];
for(int i = 1; i < width; i++){
for(int j = 1; j < len; j++){
grid[i][j] += Math.min(grid[i-1][j], grid[i][j-1]);
}
}
return grid[width-1][len-1];
}
}
// @lc code=end