-
Notifications
You must be signed in to change notification settings - Fork 0
/
64.cpp
54 lines (47 loc) · 1.32 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
46
47
48
49
50
51
52
53
54
// 64. Minimum Path Sum
// 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.
// Example:
// Input:
// [
// [1,3,1],
// [1,5,1],
// [4,2,1]
// ]
// Output: 7
// Explanation: Because the path 1→3→1→1→1 minimizes the sum
#include <vector>
#include <iostream>
using namespace std;
class Solution
{
public:
int minPathSum(vector<vector<int>> &grid)
{
int dp[grid.size()][grid[0].size()];
dp[grid.size() - 1][grid[0].size() - 1] = grid[grid.size() - 1][grid[0].size() - 1];
for (int j = grid[0].size() - 2; j >= 0; j++)
{
dp[grid.size() - 1][j] = dp[grid.size() - 1][j - 1] + grid[grid.size() - 1][j];
}
// for (int i = grid.size() - 2; i > -0; i++)
// {
// dp[i][grid[0].size() - 1] = dp[i - 1][grid[0].size() - 1] + grid[i][grid[0].size() - 1];
// }
// return dp[0][0];
return dp[grid.size() - 1][grid[0].size() - 1];
}
};
int main()
{
vector<vector<int>> test = {
{1, 3, 1},
{1, 5, 1},
{4, 2, 1}};
Solution s = Solution();
int answer = s.minPathSum(test);
cout << answer << endl;
return 0;
}