[LeetCode] 121. Best Time to Buy and Sell Stock

原题链接： https://leetcode.com/problems/best-time-to-buy-and-sell-stock/

Buy and Sell Stock专题相关题目

121. Best Time to Buy and Sell Stock
122. Best Time to Buy and Sell Stock II
123. Best Time to Buy and Sell Stock III
188. Best Time to Buy and Sell Stock IV
309. Best Time to Buy and Sell Stock with Cooldown
714. Best Time to Buy and Sell Stock with Transaction Fee

1. 题目介绍

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.

给出一个数组，数组里面的值是一支股票每天的价格，寻找最大的获利。
获利= 卖出价格b - 买入价格a，并且a一定要在b的前面（先买入，才能后卖出）。
如果获利为负数，那么返回0，否则返回最大获利。

2. 解题思路

动态规划
采用dp[]数组来记录第 i 天可能获得的最大利润。small记录当前最小的价格。
以[7,1,5,3,6,4]为例，
0: dp[0] = -7,是第一天可能获得的最大利润，small =7

1：dp[1] = -6,此时最大的获利为-6，最大获利 = 当前的价格减去史上最小价格，也就是1-7，并且只有新的最大获利高于旧的最大获利时才更新。第一天买入7，第二天卖出1，获利为-6，比之前的-7大，所以更新。small=1

2： 此时最大的获利为5-1 = 4，small还是1

3：当前的最大获利为3-1=2，小于原来的最大获利4，所以不更新。

4：最大获利变为5，但是small还是1

5：这一步small更新，最大获利不更新

6：最后一步，dp数组的最后一个元素5就是最大获利了，如果它小于零，说明无论怎么买卖股票，都不会获利，于是就返回0

注意
这个题的测试样例中应该是有一个空数组的，直接用prices[0]会报错，因此需要加入判断prices[]是否为空的步骤。

实现代码

public class Solution {
    public int maxProfit(int prices[]) {
        int length = prices.length;
        
        if(length == 0){
            return 0;
        }
        
        int[] dp = new int[length]; 
        int small = prices[0];
        dp[0] = 0-prices[0];
        
        for(int i =1;i<length;i++) {
        dp[i] =(dp[i-1]>(prices[i]-small)?dp[i-1]:(prices[i]-small));
        	
        	if(small > prices[i]) {
        		small = prices[i];
        	}
        }
        return (dp[length-1]>0 ? dp[length-1] : 0);
    }
}