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

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

与1相比不限交易次数。

C/C++ (clang++ 3.3)

1

class Solution {

2

public:

3

    int maxProfit(vector<int> &prices) {

4

        if (prices.size() == 0 || prices.size() == 1)

5

            return 0;

6

        //先找一较小价，再照一较大价格（后一天价比其低），一次交易结束。

7

        //重复交易。

8

        int count=0;

9

        int i=0;

10

        for (; i<prices.size()-1; i++)

11

            if (prices[i] < prices[i+1])

12

                break;

13

        if (i == prices.size()-1)

14

            return 0;

15

        int j=i+1;

16

        while (i < prices.size()-1){

17

            for (; j<prices.size()-1; j++)

18

                if (prices[j]>prices[j+1])

19

                    break;

20

            count = count + prices[j] - prices[i];

21

            i = ++j;

22

        }

23

24

        return count;

25

    }

26

};

借鉴网友简洁解答：

class Solution {

public :

     int maxProfit(vector< int > &prices) {

         //本题由于允许多次交易（每次必须先卖出再买进），所以不好用爆搜

         //分析可知，要想利益最大化，就应该每次在波谷买进，波峰卖出，这样利益最大，操作次数最少

         //应该是使用动态规划来做可能比较简洁，个人觉得。

         

         int len = prices.size();

         vector< int > change(len,0);

         int maxPro=0;

         for ( int i=1;i<len;i++){

             change[i]=prices[i]-prices[i-1];   //记录所有长和跌的情况

             if (change[i]>0)maxPro += change[i];   //累加所有长幅，即为最大收益

         }

         return maxPro;

     }

};