-
Notifications
You must be signed in to change notification settings - Fork 0
/
best-time-to-buy-sell-stock4.cc
43 lines (43 loc) · 1.29 KB
/
best-time-to-buy-sell-stock4.cc
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
class Solution {
public:
//check
int maxProfit(int k, vector<int>& prices) {
if (k >= prices.size() / 2) {
int res = 0;
for(int i = 0 ; i< (int)(prices.size()) - 1; i++) {
if (prices[i+1] > prices[i]) {
res += (prices[i+1] - prices[i]);
}
}
return res;
} else {
int len = prices.size();
if (k ==0) return 0;
//vector<vector<int>> sold = vector<vector<int>>(len, vector<int>(k, INT_MIN));
//vector<vector<int>> hold = vector<vector<int>>(len, vector<int>(k, INT_MIN));
vector<int> sold = vector<int>(k, INT_MIN);
vector<int> hold = vector<int>(k, INT_MIN);
for(int i = 0; i < len ;i++) {
int pre_sold = INT_MIN;
for(int j = 0; j < k; j++) {
if (i == 0) {
hold[0] = -1 * prices[i];
} else {
if (j == 0) {
hold[0] = max(-1 * prices[i], hold[j]);
} else {
if (pre_sold != INT_MIN) {
hold[j] = max(pre_sold - prices[i], hold[j]);
}
}
if (hold[j] != INT_MIN) {
pre_sold = sold[j];
sold[j] = max(hold[j] + prices[i], sold[j]);
}
}
}
}
return *max_element(sold.begin(), sold.end());
}
}
};