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 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(vector<int> &prices) {
        int profit=0;	//最大利润
		for(int i=1;i<prices.size();i++)	//扫描利润增长点
			if(prices[i]>prices[i-1])
				profit+=prices[i]-prices[i-1];
		return profit;
    }
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值