题目：
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).
一到周末简直比工作日还忙，还是不能放松刷题呐~~~(也不知道自己能坚持多久，哈哈哈)这道题的难点主要在理解题目和思路转换上，因为有股票背景，代码还是挺简单的，但是。。。我还是掉进了坑。。。泪
将买入和卖出看作一轮，为了获得最大的利润，只需满足低价买入和高价卖出的原则。
举个例子，假如prices=[3,1,4,6,5,7]
则在1时买入4时卖出，4时买入，6时卖出，5时买入，7时卖出
这样共计(4-1)+(6-4)+(7-5)=7
最后代码如下啦：
class Solution:
# @param prices, a list of integer
# @return an integer
def maxProfit(self, prices):
L=len(prices)
rs=0
for i in range(0,L-1):
if prices[i+1]>prices[i]:
rs+=(prices[i+1]-prices[i])
return rs
Leetcode_num5_Best Time to Buy and Sell Stock II
原文地址：http://blog.csdn.net/eliza1130/article/details/39437443
