forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution064.cpp
More file actions
51 lines (41 loc) · 814 Bytes
/
solution064.cpp
File metadata and controls
51 lines (41 loc) · 814 Bytes
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
/**
* Minimum Path Sum
*
* cpselvis([email protected])
* September 13th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int minPathSum(vector<vector<int> >& grid) {
int m = grid.size();
int n = grid[0].size();
if (m == 0 || n == 0)
{
return 0;
}
vector<vector<int> > dp(m, vector<int>(n));
dp[0][0] = grid[0][0];
for (int i = 1; i < m; i ++)
{
dp[i][0] = dp[i - 1][0] + grid[i][0];
}
for (int j = 1; j < n; j ++)
{
dp[0][j] = dp[0][j - 1] + grid[0][j];
}
for (int i = 1; i < m; i ++)
{
for (int j = 1; j < n; j ++)
{
dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
}
}
return dp[m - 1][n - 1];
}
};
int main(int argc, char **argv)
{
}