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/122.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/122.cpp')
| -rw-r--r-- | leetcode/cpp/122.cpp | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/leetcode/cpp/122.cpp b/leetcode/cpp/122.cpp new file mode 100644 index 0000000..68cd278 --- /dev/null +++ b/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];
+ }
+};
|