-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinimumPathSum.cpp
More file actions
31 lines (26 loc) · 907 Bytes
/
MinimumPathSum.cpp
File metadata and controls
31 lines (26 loc) · 907 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
/**
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom
right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
*/
class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
if (grid.size() ==0) return 0;
int m = grid.size(), n = grid[0].size();
vector<vector<int> > dp(m, vector<int>(n, 0));
dp[0][0] = grid[0][0];
for (int i = 1; i < m; ++i) {
dp[i][0] = grid[i][0] + dp[i-1][0];
}
for (int j = 1; j < n; ++j) {
dp[0][j] = grid[0][j] + dp[0][j-1];
}
for (int i =1; i < m; ++i) {
for (int j =1; j < n; ++j) {
dp[i][j] = std::min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
}
}
return dp[m-1][n-1];
}
};