-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinimum Path Sum
More file actions
84 lines (78 loc) · 2.73 KB
/
Minimum Path Sum
File metadata and controls
84 lines (78 loc) · 2.73 KB
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/*********************************************************************************Recursive*********************************************************************************/
class Solution {
public:
int path_sum(vector<vector<int>>& grid,int i,int j,int row,int col){
if(i==row-1 and j==col-1){
grid[i][j];
}
if(i>=row || j>=col){
return INT_MAX;
}
returngrid[i][j]+min(path_sum(grid,i+1,j,row,col),path_sum(grid,i,j+1,row,col));
}
int minPathSum(vector<vector<int>>& grid) {
int row=grid.size();
int col=grid[0].size();
int ans=path_sum(grid,0,0,row,col);
return ans;
}
};
/*********************************************************************************Memozation*********************************************************************************/
class Solution {
public:
int path_sum(vector<vector<int>>& grid,int i,int j,int row,int col,vector<vector<int>>dp){
if(i==row-1 and j==col-1){
return dp[i][j]=grid[i][j];
}
if(i>=row || j>=col){
return INT_MAX;
}
if(dp[i][j]!=-1){
return dp[i][j];
}
return dp[i][j]=grid[i][j]+min(path_sum(grid,i+1,j,row,col,dp),path_sum(grid,i,j+1,row,col,dp));
}
int minPathSum(vector<vector<int>>& grid) {
int sum;
int row=grid.size();
int col=grid[0].size();
vector<vector<int>>dp(row,vector<int>(col,-1));
int ans=path_sum(grid,0,0,row,col,dp);
return ans;
}
};
/*********************************************************************************Top Down Dp*********************************************************************************/
class Solution {
public:
int path_sum(vector<vector<int>>& grid,int i,int j,int row,int col,vector<vector<int>>dp){
if(i==row-1 and j==col-1){
return dp[i][j]=grid[i][j];
}
if(i>=row || j>=col){
return INT_MAX;
}
if(dp[i][j]!=-1){
return dp[i][j];
}
return dp[i][j]=grid[i][j]+min(path_sum(grid,i+1,j,row,col,dp),path_sum(grid,i,j+1,row,col,dp));
}
int minPathSum(vector<vector<int>>& grid) {
int sum;
int row=grid.size();
int col=grid[0].size();
vector<vector<int>>dp(row,vector<int>(col,-1));
dp[0][0]=grid[0][0];
for(int i=1;i<row;i++){
dp[i][0]=dp[i-1][0]+grid[i][0];
}
for(int i=1;i<col;i++){
dp[0][i]=dp[0][i-1]+grid[0][i];
}
for(int i=1;i<row;i++){
for(int j=1;j<col;j++){
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
}
}
return dp[row-1][col-1];
}
};