Skip to content

Commit 1bcb917

Browse files
committed
Runtime: 18 ms (Top 56.69%) | Memory: 13.1 MB (Top 35.45%)
1 parent 0271d29 commit 1bcb917

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed
Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
// Runtime: 18 ms (Top 56.69%) | Memory: 13.1 MB (Top 35.45%)
12
class Solution {
23
public:
34
int solve(int ind, int buy, int k, vector<int>& prices, vector<vector<vector<int>>>& dp){
@@ -6,10 +7,10 @@ class Solution {
67
if(buy){
78
return dp[ind][buy][k] = max(-prices[ind]+solve(ind+1, 0, k, prices, dp), solve(ind+1, 1, k, prices, dp));
89
}
9-
return dp[ind][buy][k] = max(prices[ind]+solve(ind+1, 1, k-1, prices, dp), solve(ind+1, 0, k, prices, dp));
10+
return dp[ind][buy][k] = max(prices[ind]+solve(ind+1, 1, k-1, prices, dp), solve(ind+1, 0, k, prices, dp));
1011
}
1112
int maxProfit(int k, vector<int>& prices) {
1213
vector<vector<vector<int>>> dp(prices.size(), vector<vector<int>> (2, vector<int> (k+1, -1)));
1314
return solve(0, 1, k, prices, dp);
1415
}
15-
};
16+
};

0 commit comments

Comments
 (0)