LeetCode/121-best-time-to-buy-and-sell-stock.cpp at master · benwu25/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <vector>
using namespace std;

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() == 1)
            return 0;
        int l = 0, r = 1;
        int best_dif = 0;
        while (r < prices.size()) {
            if (prices[r] - prices[l] > best_dif) {
                best_dif = prices[r] - prices[l];
                ++r;
            } else if (prices[r] >= prices[l]) {
                ++r;
            } else if (prices[r] < prices[l]) {
                l = r;
                ++r;
            }
        }
        return best_dif;
    }
};