买卖股票的最佳利润

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Not 7-1 = 6, as selling price needs to be larger than buying price.

贪心法

用一个变量存放当前的最小值
遍历数组每个值，与最小值做差，并与当前最大的差值进行比较，如果比它大则对最大差值进行更新。同时当前数组的值比当前存放的最小值要小，则对其进行更新。

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length == 0 || prices.length == 1)
            return 0;
        int min = prices[0];
        int maxPro = 0;
        for (int i = 1; i < prices.length; i++) {
            int getMoney = prices[i] - min;
            if (getMoney > maxPro) {
                maxPro = getMoney;
            }
            if (min > prices[i]) {
                min = prices[i];
            }
        }
        return maxPro;
    }
}

class Solution {
    public int maxProfit(int[] prices) {
        return utilStock(prices);
    }
    
    int utilStock(int[] prices){
        int min=Integer.MAX_VALUE;
        int max=0;
        int diff=0;
        for(int val : prices){
            if(min>val){
                min=val;
                max=val;
            }
            else if(max<val){
                max=val;
            }
            int newDif=max-min;
            if(diff<newDif){
                diff=newDif;
            }
            
        }
        return diff;
    }
}