LeetCode Best Time to Buy and Sell Stock III

原创 2015年07月08日 08:26:33

Description:

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.

Solution:

这道题目的变化是,至多可以买卖两次。

可以利用和1一样的想法,只不过1只需要从后往前遍历一次,或者从前往后遍历一次,这里就直接结合。考虑的想法是,既然买卖两次,可以以某个点为断点,前部分找一次最大,后部分找一次最大;然后遍历所有的点,将每个点前后两次最大利润加起来,取这个利润和的最大值。

import java.util.*;

public class Solution {
	public int maxProfit(int[] prices) {
		int n = prices.length;
		if (n == 0)
			return 0;

		int after[] = new int[n];
		int before[] = new int[n];

		int maxPrice = prices[n - 1], max = 0;
		for (int i = n - 1; i >= 0; i--) {
			maxPrice = Math.max(maxPrice, prices[i]);
			max = Math.max(max, maxPrice - prices[i]);
			after[i] = max;
		}

		int minPrice = prices[0];
		max = 0;
		for (int i = 0; i < n; i++) {
			minPrice = Math.min(minPrice, prices[i]);
			max = Math.max(max, prices[i] - minPrice);
			before[i] = max;
		}

		max = 0;
		for (int i = 0; i < n; i++)
			max = Math.max(max, after[i] + before[i]);
		return max;
	}
}


LeetCode(123) Best Time to Buy and Sell Stock III (Java)

题目如下: Say you have an array for which the ith element is the price of a given stock on day i. Desig...

leetcode -- Best Time to Buy and Sell Stock III --重点

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/参考: http://www.cnblogs.com/zuoyua...
  • xyqzki
  • xyqzki
  • 2015年12月10日 22:59
  • 248

[Leetcode] 123. 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. ...

leetcode_[python/C++]_121/122/123/188.Best Time to Buy and Sell Stock I/II/III/IV

121. Best Time to Buy and Sell Stock [题目] Say you have an array for which the ith element is the p...

Leetcode--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...
  • yskyj
  • yskyj
  • 2014年10月09日 17:34
  • 303

【Leetcode】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...

[leetcode] 123.Best Time to Buy and Sell Stock III

题目: My Submissions Question Solution Say you have an array for which the ith element is the price...

【leetcode】123. Best Time to Buy and Sell Stock III

Difficulty:Hard Say you have an array for which the ith element is the price of a given sto...

Best Time to Buy and Sell Stock III 最佳时间买入卖出股票(最多两次买卖)@LeetCode

直到要用DP做,但是一开始思路是错的。后来参考了 http://blog.csdn.net/pickless/article/details/12034365 才意识到可以在整个区间的每一点切开,然后...

Leetcode Best Time to Buy and Sell Stock III

要掌握这种思想: 1 两段分段思想 2 前往后,后往前都可以处理数列的思想 时间复杂度是O(n),不掌握这种思想是很难做出来的。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode Best Time to Buy and Sell Stock III
举报原因:
原因补充:

(最多只允许输入30个字)