-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaximum Difference Score in a Grid.cpp
37 lines (33 loc) · 1.15 KB
/
Maximum Difference Score in a Grid.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
class Solution {
public:
int maxScore(vector<vector<int>>& grid) {
int m = grid.size(), n = grid[0].size();
//create a dp array of size m*n
vector<vector<int>> dp(m, vector<int>(n, 0));
dp[0][0]=0;
int c1,c2;
int res=INT_MIN;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(i==0 && j==0){
continue;
}
if(i==0){
dp[i][j]=max(grid[i][j]-grid[i][j-1],grid[i][j]-grid[i][j-1]+dp[i][j-1]);
res=max(res,dp[i][j]);
}
else if(j==0){
dp[i][j]=max(grid[i][j]-grid[i-1][j],grid[i][j]-grid[i-1][j]+dp[i-1][j]);
res=max(res,dp[i][j]);
}
else{
c1=max(dp[i][j-1]+grid[i][j]-grid[i][j-1],dp[i-1][j]+grid[i][j]-grid[i-1][j]);
c2=max(grid[i][j]-grid[i][j-1],grid[i][j]-grid[i-1][j]);
dp[i][j]=max(c1,c2);
res=max(res,dp[i][j]);
}
}
}
return res;
}
};