[leetcode] Best Time to Buy and Sell Stock

<span style="font-family: 'Helvetica Neue', arial, sans-serif;">Say you have an array for which the </span><span style="background-color: transparent; font-family: 'Helvetica Neue', arial, sans-serif; margin: 0px; padding: 0px; border: 0px; outline: 0px; vertical-align: baseline;">i</span><sup style="background-color: transparent; font-family: 'Helvetica Neue', arial, sans-serif; margin: 0px; padding: 0px; border: 0px; outline: 0px; font-size: 10px; bottom: 1ex; height: 0px; line-height: 1; position: static;">th</sup><span style="background-color: transparent; font-family: 'Helvetica Neue', arial, sans-serif;"> element is the price of a given stock on day </span><span style="background-color: transparent; font-family: 'Helvetica Neue', arial, sans-serif; margin: 0px; padding: 0px; border: 0px; outline: 0px; vertical-align: baseline;">i</span><span style="background-color: transparent; font-family: 'Helvetica Neue', arial, sans-serif;">.</span>

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.

» Solve this problem

记录之前的股票最低值，判断今日的股票值-之前的最低值是否大于最大的利润。

更新最低值。

[cpp]  view plain copy print ?

1. class Solution {  
2. public:  
3.     int maxProfit(vector<int> &prices) {  
4.         // Start typing your C/C++ solution below  
5.         // DO NOT write int main() function   
6.         if (prices.size() == 0) {  
7.             return 0;  
8.         }  
9.         int min = prices[0], profit = 0;  
10.         for (int i = 1; i < prices.size(); i++) {  
11.             profit = prices[i] - min > profit ? prices[i] - min : profit;  
12.             min = prices[i] < min ? prices[i] : min;  
13.         }  
14.         return profit;  
15.     }  
16. };  

Say you have an array for which the i^th element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most two transactions.

Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

» Solve this problem

O(n^2)的算法很容易想到：

找寻一个点j，将原来的price[0..n-1]分割为price[0..j]和price[j..n-1]，分别求两段的最大profit。

进行优化：

对于点j+1，求price[0..j+1]的最大profit时，很多工作是重复的，在求price[0..j]的最大profit中已经做过了。

类似于Best Time to Buy and Sell Stock，可以在O(1)的时间从price[0..j]推出price[0..j+1]的最大profit。

但是如何从price[j..n-1]推出price[j+1..n-1]？反过来思考，我们可以用O(1)的时间由price[j+1..n-1]推出price[j..n-1]。

最终算法：

数组l[i]记录了price[0..i]的最大profit，

数组r[i]记录了price[i..n]的最大profit。

已知l[i]，求l[i+1]是简单的，同样已知r[i]，求r[i-1]也很容易。

最后，我们再用O(n)的时间找出最大的l[i]+r[i]，即为题目所求。

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int profit = 0, n = prices.size();
        if (n == 0) {
            return 0;
        }
        int l[n], r[n];
        memset(l, 0, sizeof(int) * n);
        memset(r, 0, sizeof(int) * n);
        int min = prices[0];
        for (int i = 1; i < n; i++) {
            l[i] = prices[i] - min > l[i - 1] ? prices[i] - min : l[i - 1];        
            min = prices[i] < min ? prices[i] : min;
        }
        int max = prices[n - 1];
        for (int i = n - 2; i >= 0; i--) {
            r[i] = max - prices[i] > r[i + 1] ? max - prices[i] : r[i + 1];
            max = prices[i] > max ? prices[i] : max;
        }
        for (int i = 0; i < n; i++) {
            profit = l[i] + r[i] > profit ? l[i] + r[i] : profit;
        }
        return profit;      
    }
};