leetcode.com/problems/best-time-to-buy-and-sell-stock
C++3int maxProfit(vector<int>& prices) {
4int best = 0, low = prices[0];
5for (int p : prices) {
6low = min(low, p);
7best = max(best, p - low);
8}
9retrun best;
10}
problemsLn 9
LeetSense
IntelliSense for LeetCode.