diff options
author | crupest <crupest@outlook.com> | 2020-09-27 21:27:03 +0800 |
---|---|---|
committer | crupest <crupest@outlook.com> | 2020-09-27 21:27:03 +0800 |
commit | 9e80e81d6e80340dd8b01d965374745db4b2fa01 (patch) | |
tree | 4a530bfc85c200bfd11f96dcdfbf6a3fa5eea81e | |
parent | ca302ffa2b2f0bb7b5d2c2694d4361793d896a18 (diff) | |
download | crupest-9e80e81d6e80340dd8b01d965374745db4b2fa01.tar.gz crupest-9e80e81d6e80340dd8b01d965374745db4b2fa01.tar.bz2 crupest-9e80e81d6e80340dd8b01d965374745db4b2fa01.zip |
import(solutions): Add problem 122 .
-rw-r--r-- | works/solutions/cpp/122.cpp | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/works/solutions/cpp/122.cpp b/works/solutions/cpp/122.cpp new file mode 100644 index 0000000..d468a23 --- /dev/null +++ b/works/solutions/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]; + } +}; |