-
Notifications
You must be signed in to change notification settings - Fork 0
/
maximum_profit2.cpp
101 lines (91 loc) · 2.13 KB
/
maximum_profit2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
* =====================================================================================
*
* Filename: maximum_profit2.cpp
*
* Description: 122. Best Time to Buy and Sell Stock II.
*
* Version: 1.0
* Created: 09/06/18 02:39:36
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <vector>
// Peak Valley Approach
class Solution1
{
public:
int maxProfit(const std::vector<int>& prices)
{
if (prices.size() == 0)
{
return 0;
}
int min_price = prices[0];
int max_price = 0;
int max_profit = 0;
for (size_t i = 1; i < prices.size(); i++)
{
if (prices[i] >= prices[i - 1])
{
max_price = prices[i];
}
else
{
if (max_price > min_price)
{
max_profit += max_price - min_price;
}
min_price = prices[i];
max_price = 0;
}
}
if (max_price > min_price)
{
max_profit += max_price - min_price;
}
return max_profit;
}
};
// Optimized solution
class Solution2
{
public:
int maxProfit(const std::vector<int>& prices)
{
int max_profit = 0;
for (int i = 1; i < prices.size(); i++)
{
if (prices[i] > prices[i - 1])
{
max_profit += prices[i] - prices[i - 1];
}
}
return max_profit;
}
};
using Solution = Solution2;
int main(int argc, char* argv[])
{
// std::vector<int> nums = {7, 1, 5, 3, 6, 4};
std::vector<int> nums = {1, 2, 3, 4, 5};
if (argc > 3)
{
nums.clear();
for (int i = 1; i < argc; i++)
{
nums.push_back(atoi(argv[i]));
}
}
int max = Solution().maxProfit(nums);
printf("%d\n", max);
return 0;
}