Best Time to Buy and Sell Stock II(算法分析week7)

Best Time to Buy and Sell Stock II

题目来源：https://leetcode.com/problemset/algorithms/
题目类型：贪心算法

-问题描述-
-解题思路-
-代码实现-

问题描述

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

解题思路

问题主要是为了要我们计算出一支股票可以获得的最大收益，那么我们就要将股票走势的所有上升区间得到的收益相加，这样才可以获得最大的收益。
(1)计算[i, i+1]是否为上升区间，即prices[i+1]是否大于prices[i]。如果是，将prices[i+1]-prices[i]的值加到总收益profit中。

代码实现

@requires_authorization
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int profit = 0;
        int i = 0;
        if (prices.size() == 0) return profit;
        while (i < prices.size() - 1) {
            if (prices[i + 1] > prices[i]) {
                int t = prices[i + 1] - prices[i];
                profit += t;
            }
            i++;
        }
        return profit;
    }
};