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

买卖股票的问题，在原问题 Best Time to Buy and Sell Stock 的基础上，添加条件，可以买卖多次，求最大利润。

分析

因为可以进行多次买卖，所以只要前一个数比后一个数小，就能进行一次有利润的买卖。于是我们只需遍历一遍数组，找出所有比后一个数小的数，将它们的差加起来就好。

代码

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