Best Time to Buy and Sell Stock II (Medium)

Description

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).

Analysis

和上一题差不多，区别是这次不限交易次数.只要相邻的两个差值大于0就加上就可以了

My Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
//C++
class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int len = prices.size();
        if(len==0)
            return 0;
        int ans = 0;
        for(int i = 0;i<len-1;i++){
            if(prices[i+1]>prices[i])
                ans += prices[i+1]-prices[i];
        }
        return ans;
    }
};