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

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

问题来源：Best Time to Buy and Sell Stock II (具体地址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/#/description)

思路：本题和上一题Best Time to Buy and Sell Stock 其实就是加黑的那一部分改了，其他的好像是没啥不一样的了。对于Best Time to Buy and Sell Stock本人采用的是将它转化为最大化子数组问题来解决的，而这道题相反则简单了很多，只要将数组一个一个的往后遍历，遍历到后面的数字大于前面的数字，就是满足条件的一次交易(因为题目交易次数不限)。最后，本人会将这类问题作个总结的。

代码：