(Array)121. 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.

 

 

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length<2)  return 0;
        int res=prices[1]-prices[0]; //开始是想用定义一个新的数组的，写到一半发现只要2个变量就好了
        int curmin=(res<0?prices[1]:prices[0]);
        for(int i=2;i<prices.length;i++){
            res=Math.max(res,prices[i]-curmin);
            curmin=Math.min(prices[i],curmin);
        }
        return (res>0)?res:0;  //注意返回值肯定不是负数
    }
}