Leetcode:72 Best Time to Buy and Sell Stock

Say you have an array for which the ith 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.

找出数组的最大值与最小值之差即可

class Solution {public:    int maxProfit(vector<int>& prices) {        int res = 0;        if(prices.empty())            return res;        int min = prices[0];        for(int i = 0; i < prices.size(); i++)        {            if(prices[i] < min)                min = prices[i];            if(prices[i] - min > res)                res = prices[i] - min;        }        return res;    }};