[leetcode]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.

算法思路：

遍历到第i个节点的时候，维护前i - 1个节点中最小节点，并求第i天卖出所获利润，并维护最大利润

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