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

解题思路： 只要对比相邻两天，后一天比前一天大，计算差值，相加即可。

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