-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
64.cpp
45 lines (42 loc) · 1.38 KB
/
64.cpp
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
__________________________________________________________________________________________________
8ms
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int n=grid.size(),m=n?grid[0].size():0;
vector<int> dp(m,0);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i|j) dp[j]=min(i?dp[j]:INT_MAX,j?dp[j-1]:INT_MAX);
dp[j] += grid[i][j];
}
}
return dp[m-1];
}
};
static auto _=[](){ios::sync_with_stdio(false);return 0;}();
__________________________________________________________________________________________________
10468 kb
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
for (int i = 0; i < m; ++i)
for (int j = 0; j < n; ++j) {
if (i > 0 && j > 0)
grid[i][j] += min(grid[i - 1][j], grid[i][j - 1]);
else if (i > 0)
grid[i][j] += grid[i - 1][j];
else if (j > 0)
grid[i][j] += grid[i][j - 1];
}
return grid[m - 1][n - 1];
}
};
static auto _ = []() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
return nullptr;
}();
__________________________________________________________________________________________________