题解 | #买卖股票的最好时机(一)#

import java.util.*;


public class Solution {
    /**
     * 
     * @param prices int整型一维数组 
     * @return int整型
     */
    public int maxProfit (int[] prices) {
        // write code here
        int min = prices[0];
        int profit = 0;
        int n = prices.length;
        if(n <= 1){
            return 0;
        }
        for(int i = 1; i < n; i++){
            profit = Math.max(profit, prices[i] - min);
            if(prices[i] < min){
                min = prices[i];
            }
        }
        return profit;
    }
}