LeetCode 122. Best Time to Buy and Sell Stock II--贪心--Java,C++,Python解法

题目地址：Best Time to Buy and Sell Stock II - LeetCode

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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: 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.

Example 2:

Input: [1,2,3,4,5]
Output: 4Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.Note that you cannot buy on day 1, buy on day 2 and sell them later, as you areengaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

这道题目可以买卖多次，用贪心就可以解出来了。
Python解法如下：

class Solution:def maxProfit(self, prices: List[int]) -> int:hold=0profit=0now=-1for i in prices:if now==-1:now=ielif i<now:now=ielif i>now:profit+=i-nownow=ireturn profit

Java解法如下：

class Solution {public int maxProfit(int[] prices) {int i = 0;if (prices.length==0){return 0;}int valley = prices[0];int peak = prices[0];int maxprofit = 0;while (i < prices.length - 1) {while (i < prices.length - 1 && prices[i] >= prices[i + 1])i++;valley = prices[i];while (i < prices.length - 1 && prices[i] <= prices[i + 1])i++;peak = prices[i];maxprofit += peak - valley;}return maxprofit;}
}

C++解法如下：

class Solution {public:int maxProfit(vector<int>& prices) {int len=prices.size();int profit=0;if(len==0||len==1)return 0;for(int i=0;i<len-1;i++){if(prices[i]<prices[i+1])profit+=prices[i+1]-prices[i];}return profit;}
};

LeetCode 122. Best Time to Buy and Sell Stock II--贪心--Java,C++,Python解法相关推荐

【贪心和 DP + 卖股票】LeetCode 122. Best Time to Buy and Sell Stock II
LeetCode 122. Best Time to Buy and Sell Stock II Solution1:我的答案贪心和DP傻傻分不清! class Solution { public: ...
[LeetCode]122. Best Time to Buy and Sell Stock II
[LeetCode]122. Best Time to Buy and Sell Stock II 题目描述思路 I的后续将数组分为几个小部分, 划分标准是 [i] < [i - 1](划分 ...
LeetCode 122 Best Time to Buy and Sell Stock II（股票买入卖出的最佳时间 II）
翻译话说你有一个数组,其中第i个元素表示第i天的股票价格.设计一个算法以找到最大利润.你可以尽可能多的进行交易(例如,多次买入卖出股票).然而,你不能在同一时间来多次交易.(例如,你必须在下一次买入 ...
【Leetcode】122. Best Time to Buy and Sell Stock II买卖股票的最佳时机 II
Best Time to Buy and Sell Stock II 买卖股票的最佳时机 II买卖股票的最佳时机 II Say you have an array for which the ith ...
【leetcode-Python】-Dynamic Programming -122. Best Time to Buy and Sell Stock II
目录题目链接题目描述示例解题思路 Python实现时间复杂度与空间复杂度 Python实现·优化空间复杂度时间复杂度与空间复杂度解题思路二·贪心算法 Python实现时间复杂度与空间复 ...
leetcode python3 简单题122. Best Time to Buy and Sell Stock II
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百二十二题 (1)题目英文: Say you have an array pr ...
LeetCode之路：122. Best Time to Buy and Sell Stock II
一.引言这是一道非常有趣的题目! 这是一道非常有趣的题目!! 这是一道非常有趣的题目!!! 重要的事情先说三遍 : ) 好了,接下来让我们看看这道题: Say you have an array f ...
122 Best Time to Buy and Sell Stock II 买卖股票的最佳时机 II
假设有一个数组,它的第 i 个元素是一个给定的股票在第 i 天的价格. 设计一个算法来找到最大的利润.你可以完成尽可能多的交易(多次买卖股票).然而,你不能同时参与多个交易(你必须在再次购买前出售股票 ...
LeetCode OJ - Best Time to Buy and Sell Stock II
版权声明:本文为博主原创文章,未经博主同意不得转载. https://blog.csdn.net/xiezhihua120/article/details/33817395 Say you have ...

LeetCode 122. Best Time to Buy and Sell Stock II--贪心--Java,C++,Python解法

LeetCode 122. Best Time to Buy and Sell Stock II--贪心--Java,C++,Python解法相关推荐

最新文章

热门文章