Leetcode123. Best Time to Buy and Sell Stock III

Leetcode123. Best Time to Buy and Sell Stock III

题目：

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 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).

题目分析：

题目要求我们用两次交易能找到最大的利润。刚开始的时候，看到网上的一种思路，是找到一个分界点，然后找到前后两次的最大利润之和，一开始也尝试了这种方法，但是由于设计的不合理，都是timelimited。所以，无奈，只能另外寻找方法，于是看到Best Time to Buy and Sell Stock IV的思路，是用的动态规划算法，发现也适用于这道题，于是参考那道题的做法，本题也是用的动态规划实现的。

算法分析：

定义 两个二维数组

local[i][2]（i表示第几个股票，2表示销售次数）(表示最后一次交易在第i天交易的最大利润)

global[i][2] (i表示第几个股票，2表示销售次数) （表示在第i天的最大利润）

关系如下：

if (j == 0) {
	local[i][j] = max(max(0,diff),local[i - 1][j] + diff);
	global[i][j] = max(local[i][j], global[i - 1][j]);
}
else {
	local[i][j] = max(global[i - 1][j - 1] + (diff > 0 ? diff : 0), local[i - 1][j] + diff);
	global[i][j] = max(local[i][j], global[i - 1][j]);
}

代码部分：

class Solution {
public:
	int maxProfit(vector<int>& prices) {
		if (prices.size() <= 1) return 0;
		int n = prices.size();
		int **local = new int*[n];
		for (int i = 0; i < n; i++)
			local[i] = new int[2];
		int **global = new int*[n];
		for (int i = 0; i < n; i++)
			global[i] = new int[2];
		local[0][0] = local[0][1] = 0;
		global[0][0] = global[0][1] = 0;
		for (int i = 1; i < n; i++) {
			int diff = prices[i] - prices[i - 1];
			for (int j = 0; j < 2; j++) {
				if (j == 0) {
					local[i][j] = max(max(0,diff),local[i - 1][j] + diff);
					global[i][j] = max(local[i][j], global[i - 1][j]);
				}
				else {
					local[i][j] = max(global[i - 1][j - 1] + (diff > 0 ? diff : 0), local[i - 1][j] + diff);
					global[i][j] = max(local[i][j], global[i - 1][j]);
				}
			}
		}
		return global[n - 1][1];
	}
	int max(int a, int b) {
		return a > b ? a : b;
	}
};