LintCode 买卖股票的最佳时机题目分析代码

public class Solution {
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    public int maxProfit(int[] prices) {
        // write your code here
        if(prices == null || prices.length == 0)
            return 0;
        
        int min = Integer.MAX_VALUE;  //store the min value that until now;
        int profit = 0;   //store the profit, initial value is zero;
        
        for(int i:prices) {
            min = Math.min(min, i);
            profit = Math.max(profit, i-min);
        }
        return profit;
    }
}