Best Time to Buy and Sell Stock

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.

这一系列的题很多，这个事只能做一次交易

思路

1. 最暴力的两次循环啊，但是时间会很长!!!!!!!

注意事项

1. 传入参数判断
   if(pricesSize<=1) return 0;
   是1，有一天也是返回0，而不是==0
   
   
2. 设置一个变量记录的是每两个差值之间的累积和

代码

int maxProfit(int* prices, int pricesSize) {
    if(pricesSize<=1) return 0;
    int i;
    int profit = 0;
    int diff = 0;
    for(i=1;i<pricesSize;i++)
    {
        diff += prices[i]-prices[i-1];
        if(diff<0)
           diff = 0;
        if(diff>profit)
            profit = diff;
    }
    return profit;
}