Leetcode 121: Best Time to Buy and Sell Stock

问题描述：

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

两个数组，一个记录截至第i日的最低价，另一个数组记录利润=input 数组 - 最低价数组

代码：

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

时间复杂度：O(n)