leetcode-121

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.

Subscribe to see which companies asked this question

int maxProfit(int* prices, int pricesSize) {
    int max,min,i,k,maxall=0;
    max = min = prices[0];
    for(i = 1;i < pricesSize;i++)
    {
        if(prices[i] > max)
            max = prices[i];
        if(prices[i] < min)
        {
            k = max-min;
            if(k>maxall)
                maxall = k;
            min = prices[i];
            max = min;
        }
    }
    maxall = maxall>(max-min)?maxall:(max-min);
    return maxall;
}

思路：

首先max = min = price[0];

如果找到一个比min小的数，则将其赋给min,并存maxall，maxall 为所有max-min的最大值，如此搜索到最后，最后判断max-min与maxall大小，考虑一直增长的情况。时间复杂度为O(N)；