122. Best Time to Buy and Sell Stock II

原网页为https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/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).

二、解法

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

这道题可以用贪婪算法解决，我这里的策略是如果价格是局部最小的，那么就买进，如果是局部最大的，就卖出