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/122.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/122.cpp')
-rw-r--r-- | works/solutions/leetcode/cpp/122.cpp | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/122.cpp b/works/solutions/leetcode/cpp/122.cpp new file mode 100644 index 0000000..68cd278 --- /dev/null +++ b/works/solutions/leetcode/cpp/122.cpp @@ -0,0 +1,28 @@ +#include <vector>
+
+using std::vector;
+
+class Solution
+{
+public:
+ int maxProfit(vector<int> &prices)
+ {
+ if (prices.size() <= 1)
+ return 0;
+
+ int day_count = prices.size();
+
+ vector<vector<int>> dp(day_count, std::vector<int>(2));
+
+ dp[0][0] = 0;
+ dp[0][1] = -prices[0];
+
+ for (int i = 1; i < day_count; i++)
+ {
+ dp[i][0] = std::max(dp[i - 1][0], dp[i - 1][1] + prices[i]);
+ dp[i][1] = std::max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
+ }
+
+ return dp[day_count - 1][0];
+ }
+};
|