leetcode-121 Best Time to Buy and Sell Stock Easy

题目

买卖一次股票，最佳时间分别在哪？

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.
Example 2:

Input: [7,6,4,3,1]
Output: 0

Explanation: In this case, no transaction is done, i.e. max profit = 0.

思路

比较直观的解法是通过双层循环，依次比较每一个买入点对应的最大差价，但是时间复杂度为O(n^2)，不太理想
一种比较巧妙的解法是只通过一次遍历，在这个过程中维护两个变量：最小价格以及最大利润
因为最大利润并不一定是在最低价格处买入而导致的，所以要对途中所有的“较低点”买入可能产生的最大利润进行比较，这种解法的时间复杂度为O(n)

代码

class Solution {
    public int maxProfit(int[] prices) {
    	if (prices == null || prices.length < 1) {
            return 0;
        }
        //以上的判断在数组题中是常见的，因为如果不进行判断，那么再下面int minPrice = prices[0]这句可能会造成数组下标越界
        //若不进行上面的判断，那么int minPrice = prices[0] 可以改成 int minprice = Integer.MAX_VALUE
        int maxProfit = 0;//最大利润
        int minPrice = prices[0];//最小价格
        for(int i = 0 ;i<prices.length; i++){
        	if(prices[i] < minPrice)//更新最小价格
        		minPrice = prices[i];
        	else if(prices[i] - minPrice > maxProfit)//更新最大利润
        		maxProfit = prices[i] - minPrice;
        }
        return maxProfit;
    }
}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Best Time to Buy and Sell Stock.
Memory Usage: 35.5 MB, less than 98.29% of Java online submissions for Best Time to Buy and Sell Stock.