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/121.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/121.cpp')
| -rw-r--r-- | leetcode/cpp/121.cpp | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/leetcode/cpp/121.cpp b/leetcode/cpp/121.cpp new file mode 100644 index 0000000..8561fa3 --- /dev/null +++ b/leetcode/cpp/121.cpp @@ -0,0 +1,24 @@ +#include <vector>
+
+using std::vector;
+
+class Solution
+{
+public:
+ int maxProfit(vector<int> &prices)
+ {
+ if (prices.size() <= 1) return 0;
+
+ int result = 0;
+ int min = prices.front();
+ for (int i = 1; i < prices.size(); i++)
+ {
+ if (prices[i] - min > result)
+ result = prices[i] - min;
+ if (prices[i] < min)
+ min = prices[i];
+ }
+
+ return result;
+ }
+};
|