class Solution:
# @param {integer[]} prices
# @return {integer}
def maxProfit(self, prices):
profit = 0;
for i in xrange(1, len(prices)):
if prices[i] > prices[i-1]:
profit += prices[i] - prices[i-1]
return profit
版权声明：本文为博主原创文章，未经博主允许不得转载。
Leetcode Best Time to Buy and Sell Stock II
原文：http://blog.csdn.net/andrew9tech/article/details/46756331