121. Best Time to Buy and Sell Stock

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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Example 1:

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

max. difference = 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

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

题意：给定一个数组，每个元素表示某只股票一天的价格，请问进行一次交易（也可以不交易）的利润最大是多少？

动态规划解决此题，我们定义一个dp[]数组，dp[i]表示第i天卖出股票的最大利润。

显然，dp[0] = 股票第一天的价格-初始价格

dp[i] 有以下2种情况，

1.dp[i-1]>=0.此时，股票买入的时间与dp[i-1]相同，dp[i]= 股票第i天的价格 - 股票第i天的价格 + dp[i-1]

2.dp[i-1]<0.此时，股票买入的时间就是第i-1天，dp[i] = 股票第i天的价格 - 股票第i-1天的价格

最后，求出数组dp[]和0中的最大值，就是我们要求的结果；

下面贴代码：

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length<=1) return 0;
        int[] dp = new int[prices.length-1];
        dp[0] = prices[1]-prices[0];
        for(int i=1;i<dp.length;i++){
            if(dp[i-1]>=0) dp[i] = prices[i+1] - (prices[i]-dp[i-1]);
            else dp[i] = prices[i+1] - prices[i];
            //System.out.println(dp[i]);
        }
        int max = 0;
        for(int k:dp){
            if(k>max)
            max = k;
        }
        return max;
    }
}