Best_Time_to_Buy_and_Sell_Stock.cpp

// 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) {
        if (prices.size() == 0)
            return 0;
        int Min = prices[0], result = 0;
        for (int i = 0; i < prices.size(); i++) {
            Min = Min < prices[i] ? Min : prices[i];
            int profit = prices[i] - Min;
            result = result > profit ? result : profit;
        }
        return result;
    }
};