标签：
题目：
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).
C++:
class Solution { public: int maxProfit(vector<int>& prices) { unsigned int i=0,profit=0; if(prices.size()==0) { return 0; }else { for(i=0;i<prices.size()-1;i++) { if(prices[i+1]-prices[i]>0) { profit+=(prices[i+1]-prices[i]); } } return profit; } } };
C：
int maxProfit(int* prices, int pricesSize) { if(pricesSize<=0) return 0; int tmp; //初始错误将tmp定义为unsigned int unsigned int i,profit=0; for(i=0;i<(pricesSize-1);i++) { tmp=prices[i+1]-prices[i]; if(tmp>0) { profit+=tmp; } } return profit; }
Best Time to Buy and Sell Stock II
标签：
原文地址：http://www.cnblogs.com/jason1990/p/4638931.html
