122. Best Time to Buy and Sell Stock II 最佳买卖股票的时间
2017-11-28 16:38
543 查看
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 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).
题目解析:可以由多次交易买卖,只要最后受益最大就可以
class Solution {
public int maxProfit(int[] prices) {
if(prices==null||prices.length<=1){
return 0;
}
int profit=0;
for(int i=0;i<prices.length-1;i++){
if(prices[i+1]-prices[i]>0){
profit +=prices[i+1]-prices[i];
}
}
return profit;
}
}
解题思路:
简单来想,就是计算所有的受益,也就是计算每天能够获得的受益。如果就像题目要求的you may not engage in multiple transactions at the same time,如果这个要求是一天不能先卖出后买卖,其实也可以用如上的方法进行计算最大profit。
比如,[1,2,3],选择1->2->3跟1->3计算结果一样.
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 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).
题目解析:可以由多次交易买卖,只要最后受益最大就可以
class Solution {
public int maxProfit(int[] prices) {
if(prices==null||prices.length<=1){
return 0;
}
int profit=0;
for(int i=0;i<prices.length-1;i++){
if(prices[i+1]-prices[i]>0){
profit +=prices[i+1]-prices[i];
}
}
return profit;
}
}
解题思路:
简单来想,就是计算所有的受益,也就是计算每天能够获得的受益。如果就像题目要求的you may not engage in multiple transactions at the same time,如果这个要求是一天不能先卖出后买卖,其实也可以用如上的方法进行计算最大profit。
比如,[1,2,3],选择1->2->3跟1->3计算结果一样.
相关文章推荐
- LeetCode 122 Best Time to Buy and Sell Stock II(股票买入卖出的最佳时间 II)
- LeetCode 122 Best Time to Buy and Sell Stock II(股票买入卖出的最佳时间 II)
- LeetCode OJ 之 Best Time to Buy and Sell Stock II (买卖股票的最佳时间 2)
- Best Time to Buy and Sell Stock II 最佳时间买入卖出股票(多次买卖)@LeetCode
- LeetCode 122 Best Time to Buy and Sell Stock II(股票买入卖出的最佳时间 II)
- 121. Best Time to Buy and Sell Stock 最佳买卖股票时间
- [Leetcode] Best time to buy and sell stock ii 买卖股票的最佳时机
- LeetCode-121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)
- [LeetCode] 123. Best Time to Buy and Sell Stock III 买卖股票的最佳时间 III
- 【LeetCode-面试算法经典-Java实现】【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】
- [LintCode] Best Time to Buy and Sell Stock 买卖股票的最佳时间
- [LeetCode] 188. Best Time to Buy and Sell Stock IV 买卖股票的最佳时间 IV
- [LintCode] Best Time to Buy and Sell Stock II 买股票的最佳时间之二
- LeetCode OJ 之 Best Time to Buy and Sell Stock (买卖股票的最佳时间)
- [LeetCode 122] - 买入与卖出股票的最佳时机II(Best Time to Buy and Sell Stock II)
- [LeetCode] Best Time to Buy and Sell Stock IV 买卖股票的最佳时间之四
- Best Time to Buy and Sell Stock 【最佳买卖股票的时间】【容易】
- [LeetCode] Best Time to Buy and Sell Stock IV 买卖股票的最佳时间之四
- leetcode 121.Best Time to Buy and Sell Stock 股票买卖最佳时间
- LintCode--best-time-to-buy-and-sell-stock-ii(买卖股票的最佳时机 II)