算法分析与设计week03--122.Best Time to Buy and Sell Stock II

Leetcode 122.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 max_profit = 0;            for (int i = 1; i < prices.size(); i++) {                if (prices[i] > prices[i - 1]) {                    max_profit += prices[i] - prices[i - 1];                }            }            return max_profit;        }}; 

复杂度分析

时间复杂度：O(n)
空间复杂度：O(1)