LeetCode编程练习 - Best Time to Buy and Sell Stock II学习心得
题目：
Say you have an array for which theith 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).
假设有一个数组，第i个元素是给定股票的价格。设计一种算法以获得最大利润。可以完成许多交易(例如，购买一个股票，并多次出售股票)。不会同时参与多个交易(例如，必须在再次购买之前卖出股票)。
思路：
多次售卖，我的想法是只要对差价进行叠加就好。但值得注意的是，在遍历的时候，变量i的初始值为1.