[LeetCode]Best Time to Buy and Sell Stock II

Say you have an array for which the i^th 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).

多次低买高卖，被size（）不能减一， 不能倒数第一天买，这些边界弄的怪郁闷的。。。我在去google一下。

class Solution {public:    int maxProfit(vector<int> &prices) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int max = 0;        int i = 0;while(  i != prices.size()){if(i + 1 != prices.size() && prices[i+1] <= prices[i]){                i++;continue;}    intj = i + 1;if (j != prices.size()){while( j + 1 !=  prices.size() && prices[j+1] >= prices[j]){ j++;continue;}max = max + prices[j] - prices[i];                 i = j + 1;}if(j == prices.size()|| i== prices.size())return max ;            }return max;    }};