[LeetCode] Best Time to Buy and Sell Stock

[Problem]

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.

[Anlysis]
给定一个数组，寻找数组中两个元素（A[i]，A[j]）的最大差，且i≤j。例如[5，1，4，2，6]，则最大差为[1,6]=5.
方法一：暴力，对于每一个元素，寻找在它前面的最小元素，复杂度为O(n^2)
方法二：动规，复杂度为O(n)。定义一个变量minPrice，从1~n遍历数组，用minPrice记录当前遍历过的元素中的最小值。对于第i个元素，能够获得最大的profile可以表示为
maxProfile[i] = prices[i] > minPrice ? proces[i] - minPrice : 0;
minPrice = minPrice < prices[i] ? minPrice : prices[i];
最后返回max{maxProfile[1...n]}

[Solution]

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(prices.size() <= 0)return 0;
       
        // search max profile
        int maxProfile[prices.size()];
        int minPrice = prices[0];
        int maxP = -1;
        for(int i = 0; i < prices.size(); ++i){
            if(prices[i] > minPrice){
                maxProfile[i] = prices[i] - minPrice;
            }
            else{
                maxProfile[i] = 0;
            }
            minPrice = minPrice < prices[i] ? minPrice : prices[i];
            maxP = maxP > maxProfile[i] ? maxP : maxProfile[i];
        }
        return maxPrice;
    }
};

说明：版权所有，转载请注明出处。 Coder007的博客