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 | 185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 (patch) | |
tree | 3f19388b054fb2a12230706681dd62f077890c51 /works/solutions/leetcode/cpp/123.cpp | |
parent | ca5a0f8dde5d8d9d7f877a790d05a270cc3224f9 (diff) | |
download | crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.gz crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.bz2 crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.zip |
import(solutions): Move leetcode solutions to subdir.
Diffstat (limited to 'works/solutions/leetcode/cpp/123.cpp')
-rw-r--r-- | works/solutions/leetcode/cpp/123.cpp | 34 |
1 files changed, 34 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/123.cpp b/works/solutions/leetcode/cpp/123.cpp new file mode 100644 index 0000000..ecf35c4 --- /dev/null +++ b/works/solutions/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});
+ }
+};
|