首页 > 代码库 > LeetCode: Best Time to Buy and Sell Stock II [122]
LeetCode: Best Time to Buy and Sell Stock II [122]
【题目】
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).
【题意】
给定一个数组prices, prices[i]表示第i天的股价。本题没有买卖次数的限制,问最大收益是多少【思路】
贪心思想。如果股价一路上扬,则持币观望,直到股价升到最高点抛售获利最大。【代码】
class Solution { public: int maxProfit(vector<int> &prices) { int size=prices.size(); if(size<=1)return 0; int maxProfit=0; int buyDate=0; for(int i=1; i<size; i++){ if(prices[i-1]>prices[i]){ //股价开始下跌,在i-1天抛售 maxProfit+=prices[i-1]-prices[buyDate]; buyDate=i; } } //【注意】别忘了最后一次买卖 maxProfit+=prices[size-1]-prices[buyDate]; return maxProfit; } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。