diff options
| author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
| commit | d8f3b40085619cb680c8f227c65a1f5acc393223 (patch) | |
| tree | 6a38e3a6c79276fc396259ef962d17236dbed569 /leetcode/cpp/123.cpp | |
| parent | b0162802ad9723c678e495f29ca2f0fc0af2eff1 (diff) | |
| download | solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.gz solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.tar.bz2 solutions-d8f3b40085619cb680c8f227c65a1f5acc393223.zip | |
Move leetcode solutions to subdir.
Diffstat (limited to 'leetcode/cpp/123.cpp')
| -rw-r--r-- | leetcode/cpp/123.cpp | 34 |
1 files changed, 34 insertions, 0 deletions
diff --git a/leetcode/cpp/123.cpp b/leetcode/cpp/123.cpp new file mode 100644 index 0000000..ecf35c4 --- /dev/null +++ b/leetcode/cpp/123.cpp @@ -0,0 +1,34 @@ +#include <vector>
+#include <iostream>
+using std::vector;
+
+#include <algorithm>
+
+class Solution
+{
+public:
+ // 0 -> after buy for the first time
+ // 1 -> after sell for the first time
+ // 2 -> after buy for the second time
+ // 3 -> after sell for the second time
+
+ int maxProfit(vector<int> &prices)
+ {
+ int day_count = prices.size();
+
+ int state_0 = -prices[0];
+ int state_1 = 0;
+ int state_2 = -prices[0];
+ int state_3 = 0;
+
+ for (int day = 1; day < day_count; day++)
+ {
+ state_0 = std::max(state_0, -prices[day]);
+ state_1 = std::max(state_1, state_0 + prices[day]);
+ state_2 = std::max(state_2, state_1 - prices[day]);
+ state_3 = std::max(state_3, state_2 + prices[day]);
+ }
+
+ return std::max({state_0, state_1, state_2, state_3});
+ }
+};
|