1.题目

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.

2.解决方式

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

www.waitingfy.com/archives/1640