LeetCode 122. Best Time to Buy and Sell Stock II

题目来源：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

问题描述

122. Best Time to Buy and Sell Stock II

Easy

Say you have an array for which the ithelement 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]

Output: 7

Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.

             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]

Output: 4

Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.

             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are

             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]

Output: 0

Explanation: In this case, no transaction is done, i.e. max profit = 0.

------------------------------------------------------------

题意

给定一个数组表示若干个时段股票的价格，允许多次买卖，允许一个时段既卖出又买入，求最大获利。

------------------------------------------------------------

思路

传说中的炒股“买涨不买跌，稳赚不赔”。如果真的可以知道未来一段时间股票的价格，那就真的可以这样操作，要想利益最大化，只要涨了就抛，所以算法也非常简单。

------------------------------------------------------------

代码

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