forked from sunstick/code-street
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminimum_path_sum.cpp
More file actions
25 lines (20 loc) · 818 Bytes
/
minimum_path_sum.cpp
File metadata and controls
25 lines (20 loc) · 818 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
/*
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) {
int m = grid.size();
int n = grid[0].size();
int dp[m][n];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
if (i == 0 && j == 0) dp[i][j] = grid[i][j];
else if (i == 0) dp[i][j] = dp[i][j - 1] + grid[i][j];
else if (j == 0) dp[i][j] = dp[i - 1][j] + grid[i][j];
else dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
return dp[m - 1][n - 1];
}
};