剑指Offer 63 股票的最大利润

Java版代码，leetcode地址：

class Solution {
    public int maxProfit(int[] prices) {
        int min_price = Integer.MAX_VALUE;
        int maxprofit = 0;
        int l = prices.length;
        for(int i = 0;i < l;i++){
            if(prices[i] < min_price){
                min_price = prices[i];
            }else if(prices[i] - min_price > maxprofit){
                maxprofit = prices[i] - min_price;
            }
        }
        return maxprofit;
    }
}