算法分析与设计课程作业第七周#1#2

算法分析与设计课程作业第七周#1#2

这周选了以动态规划为标签的股票买卖问题系列的前两题来做，以下为题目：

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.

思路

只能买卖一次，所以问题就是要求后面值减前面值的最大的最大差值。因为比较简单，就直接给出递归求解公式如下（由到前i-1次价格买卖的最大利润求出到第i次价格买卖的最大利润）：
profit[i] = max(prices[i]-min{prices[j]|j=1,...,i-1}, profit[i-1])
事实上profit不需用一个数组存储，只用一个变量也行，每次都更新profit即可。

代码

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.empty()){
            return 0;
        }
        int min = prices[0];
        int profit = 0;
        for(int i = 0; i < prices.size(); i++){
            profit = (prices[i] - min > profit)?prices[i] - min:profit;
            min = prices[i] < min?prices[i]:min;
        }
        return profit;
    }
};

122. Best Time to Buy and Sell Stock II

Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

思路

对比前一题，这一题可以买卖股票任意多次，所以遍历数组，每次将遍历到的极大值减去其之前的极小值即可。此为第一个版本代码。
而其实，遍历数组，如果遍历到的值比起前一个值大，就考虑之前以前一个值价格买入，该值价格卖出，也能得到同样的结果。

122第一个版本代码

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.empty() || prices.size() == 1){
            return 0;
        }
        int min = prices[0];
        int profit = 0;
        bool up = false;
        for(int i = 1; i < prices.size(); i++){
            if(prices[i] < prices[i-1]){
                if(up == true){
                    profit += prices[i-1] - min;
                }
                min = prices[i];
            }
            if(prices[i] > prices[i-1]){
                if(up == false){
                    up = true;
                }
            }
        }
        if(prices[prices.size()-1] - min > 0)
            profit += prices[prices.size()-1] - min;
        return profit;
    }
};

122第二个版本代码

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.empty() || prices.size() == 1){
            return 0;
        }
        int profit = 0;
        for(int i = 1; i < prices.size(); i++){
            if(prices[i] > prices[i-1]){
                profit += prices[i] - prices[i-1];
            }
        }
        return profit;
    }
};