LeetCode:Best Time to Buy and Sell Stock III
来源:互联网 发布:gentoo网络 编辑:程序博客网 时间:2024/06/05 05:05
题目:
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).
思路:
这是上一篇博客的题目的类似题,不同的是上次的只允许交易一次,这次最多允许交易两次。
上一篇博客的思路:从price[0]开始,找出当前最小的价格,然后得出当前最大的利润,不断更新最小价格和最大利润,直到遍历完price,从而得到最大利润。
这次依然用这个思路,但是把这两次交易分为first和second,first[i]代表从第1天到第i+1天为止交易一次得到的最大利润,显然first[0] (第一天买进,第一天卖出)为0。second[i]表示从第i+1天到最后一天交易一次得到的最大利润,显然second[size-1](最后一天买进,最后一天卖出)为0。first[i]和second[i]两次交易加起来刚好是第一天到最后一天交易两次所得的利润。(i=0或i=size-1等价于只交易一次)
要想得到交易两次的最大利润,只需要求出first[i]+second[i]的最大值。
代码:
class Solution {public: int maxProfit(vector<int>& prices) { int size = prices.size(); if (size == 0) return 0; vector<int> first(size); vector<int> second(size); int minPrice = prices[0]; first[0] = 0; for (int i = 1; i < size; i++) { minPrice = min(minPrice, prices[i]); first[i] = max(first[i-1], prices[i] - minPrice); } int maxPrice = prices[size-1]; second[size-1] = 0; for (int i = size-2; i >= 0; i--) { maxPrice = max(maxPrice, prices[i]); second[i] = max(second[i+1], maxPrice - prices[i]); } int maxPro = 0; for (int i = 0; i < size; i++) { maxPro = max(maxPro, first[i] + second[i]); } return maxPro; }};
- LeetCode Best Time to Buy and Sell Stock III
- LeetCode Best Time to Buy and Sell Stock III
- [Leetcode] Best Time to Buy and Sell Stock III
- leetcode 16: Best Time to Buy and Sell Stock III
- LeetCode Best Time to Buy and Sell Stock III
- [LeetCode] Best Time to Buy and Sell Stock III
- leetcode 62: Best Time to Buy and Sell Stock III
- [LeetCode] Best Time to Buy and Sell Stock III
- 【leetcode】Best Time to Buy and Sell Stock III
- LeetCode - Best Time to Buy and Sell Stock III
- LeetCode之Best Time to Buy and Sell Stock III
- [LeetCode]Best Time to Buy and Sell Stock III
- LeetCode: Best Time to Buy and Sell Stock III
- [Leetcode]Best Time to Buy and Sell Stock III
- [leetcode]Best Time to Buy and Sell Stock III
- leetcode题目:Best Time to Buy and Sell Stock III
- [LeetCode] Best Time to Buy and Sell Stock III
- LeetCode-Best Time to Buy and Sell Stock III
- 乐视kido发布首款智能儿童手表:接入图灵机器人引擎
- oracle学习(使用了PL/SQL)——1
- 温润手感,vivo X7首发开箱图赏
- 腾讯应用宝全新广告片上线 宋仲基首次代言互联网产品
- 构建无处不在的深度学习部署系统
- LeetCode:Best Time to Buy and Sell Stock III
- Linux学习路径(图)
- 小程序跳转刷新
- imagick的简单使用
- Linux应用编程基础--(6)守护进程
- Gym 101572D Distinctive Character【思维+Bfs】
- three.js 01-06 之使用 ASCII 效果
- 可能是MacOS中最好用的集成开发工具-Xcode初学者(C/C++ 新生)教程
- 定时编译java代码设置