Runtime: 68 ms, faster than 5.85% of Python3 online submissions for Best Time to Buy and Sell Stock II. Memory Usage: 14.2 MB, less than 5.06% of Python3 online submissions for Best Time to Buy and Sell Stock II. 所以想提高,还是要学一下迭代器的应用啊。 标签: python , LeetCode ...
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). ...
【leetcode】43-best-time-to-buy-and-sell-stock-iv 力扣 188. 买卖股票的最佳时机 IV 【leetcode】44-best-time-to-buy-and-sell-stock-with-cooldown 力扣 309. 买卖股票的最佳时机包含冷冻期 【leetcode】45-best-time-to-buy-and-sell-stock-with-cooldown 力扣 714. 买卖股票的最佳时机包含手续费 ...
Leetcode: 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 ...
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ 因为可以进行无限次交易,并且在下一次buy之前必须已经sell。所以只需要把所有price曲线价格上涨的部分加起来就行。 class Solution(object): def maxProfit(self, prices): """
122. 买卖股票的最佳时机 II - 给你一个整数数组 prices ,其中 prices[i] 表示某支股票第 i 天的价格。 在每一天,你可以决定是否购买和/或出售股票。你在任何时候 最多 只能持有 一股 股票。你也可以先购买,然后在 同一天 出售。 返回 你能获得的 最大 利润 。 示
122. 买卖股票的最佳时机 II - 给你一个整数数组 prices ,其中 prices[i] 表示某支股票第 i 天的价格。 在每一天,你可以决定是否购买和/或出售股票。你在任何时候 最多 只能持有 一股 股票。你也可以先购买,然后在 同一天 出售。 返回 你能获得的 最大 利润 。 示
Input: [7,1,5,3,6,4] Output: 7 Examplanation:Buy on day 2(price = 1) and sell on day 3 (price = 5), profit = 5 - 1 = 4. Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6 - 3 = 3 Example2: Input: [1,2,3,4,5] Output: 4 Explat...
classSolution{publicintmaxProfit(int[]prices){intmoney=0;for(inti=0;i<prices.length-1;i++){money=(prices[i+1]>prices[i]?prices[i+1]-prices[i]:0)+money;}returnmoney;}} 0 0 1 2 3 4 5 6 classSolution{ public: intmaxProfit(vector<int>&prices) { ...
Best Time to Buy and Sell Stock IV中是求某个给定k次交易的最大收益,和Maximum Subarray III完全一样 本题由于是可以操作任意次数,只为获得最大收益,而且对于一个上升子序列,比如:[5, 1, 2, 3, 4]中的1, 2, 3, 4序列来说,对于两种操作方案: 1 在1买入,4卖出 2 在1买入,2卖出同时买入,3卖出...