[Leetcode] 714. Best Time to Buy and Sell Stock with Transaction Fee 解题报告
2018-02-14 21:48
375 查看
题目:
Your are given an array of integers
element is the price of a given stock on day
a transaction fee.
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
Return the maximum profit you can make.
Example 1:
Note:
思路:
我们定义两个状态s0和s1,其中s0表示某天拥有0支股票时的最大收益,s1表示某天拥有1支股票时的最大收益。那么在第i天,如果卖掉一支股票可以获得更大收益,则卖掉股票;否则维持原来手里没有股票时的收益。而如果买一支股票可以获得更大的收益,则买一支股票(除了支付股票费用之外还需要支付手续费);否则维持原来手里还有一支股票。最终返回s0即可。
算法的时间复杂度是O(n),空间复杂度是O(1)。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int s0 = 0;
int s1 = INT_MIN;
for (int i = 0; i < prices.size(); ++i) {
int temp = s0;
s0 = max(s0, s1 + prices[i]); // sell a stock at day[i]
s1 = max(s1, temp - prices[i] - fee); // buy a stock at day[i]
}
return s0;
}
};
Your are given an array of integers
prices, for which the
i-th
element is the price of a given stock on day
i; and a non-negative integer
feerepresenting
a transaction fee.
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
Return the maximum profit you can make.
Example 1:
Input: prices = [1, 3, 2, 8, 4, 9], fee = 2 Output: 8 Explanation: The maximum profit can be achieved by:Buying at prices[0] = 1Selling at prices[3] = 8Buying at prices[4] = 4Selling at prices[5] = 9The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
Note:
0 < prices.length <= 50000.
0 < prices[i] < 50000.
0 <= fee < 50000.
思路:
我们定义两个状态s0和s1,其中s0表示某天拥有0支股票时的最大收益,s1表示某天拥有1支股票时的最大收益。那么在第i天,如果卖掉一支股票可以获得更大收益,则卖掉股票;否则维持原来手里没有股票时的收益。而如果买一支股票可以获得更大的收益,则买一支股票(除了支付股票费用之外还需要支付手续费);否则维持原来手里还有一支股票。最终返回s0即可。
算法的时间复杂度是O(n),空间复杂度是O(1)。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int s0 = 0;
int s1 = INT_MIN;
for (int i = 0; i < prices.size(); ++i) {
int temp = s0;
s0 = max(s0, s1 + prices[i]); // sell a stock at day[i]
s1 = max(s1, temp - prices[i] - fee); // buy a stock at day[i]
}
return s0;
}
};
相关文章推荐
- 【LeetCode】404.Sum of Left Leaves(Easy)解题报告
- LeetCode 409. Longest Palindrome 解题报告
- LeetCode 64. Minimum Path Sum 解题报告
- LeetCode: Valid Parentheses 解题报告
- leetcode解题报告:44 Wildcard Matching
- [Leetcode] 649. Dota2 Senate 解题报告
- [LeetCode]Find Minimum in Rotated Sorted Array,解题报告
- leetcode第七周解题报告
- [Leetcode] 370. Range Addition 解题报告
- [leetcode] 289. Game of Life 解题报告
- LeetCode 62 Unique Paths 解题报告
- [leetcode] 78. Subsets 解题报告
- [Leetcode] 82. Remove Duplicates from Sorted List II 解题报告
- 【LeetCode】Longest Common Prefix 解题报告
- leetcode解题报告: 85 Maximal Rectangle
- Leetcode 376. Wiggle Subsequence 摇摆序列 解题报告
- 【LeetCode】695. Max Area of Island 解题报告
- leetcode 解题报告 Word Ladder II
- [leetcode] 164. Maximum Gap 解题报告
- [Leetcode] 665. Non-decreasing Array 解题报告