leetcodeOJ 121. Best Time to Buy and Sell Stock

Say you have an array for which the i^th element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Example 1:

Input: [7, 1, 5, 3, 6, 4]Output: 5max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example 2:

Input: [7, 6, 4, 3, 1]Output: 0In this case, no transaction is done, i.e. max profit = 0.

class Solution {public:    int maxProfit(vector<int>& prices) {        int ans = 0;//大不了没有交易，则没有利润，所以结果最低为0        if(prices.size() == 0)            return ans;        int curLow = prices[0];        for(int i = 1; i < prices.size(); i++){            ans = max(ans, prices[i]-curLow);            curLow = min(curLow, prices[i]);        }        return ans;    }};