想复杂了,参考了别人的思路
class Solution {
public:
int maxProfit(vector<int>& prices) {
int total = 0;
for(int i=1; i<prices.size(); i++)
{
if((prices[i]-prices[i-1])>0)
total += prices[i]-prices[i-1];
}
return total;
}
};