问题描述
解决方案
class Solution {
public:
int maxProfit(vector<int>& prices) {
int ret =0;
for(int i=1;i<prices.size();++i){
ret +=max(prices[i]-prices[i-1],0);
}
return ret ;
}
};
class Solution {
public:
int maxProfit(vector<int>& prices) {
int ret =0;
for(int i=1;i<prices.size();++i){
ret +=max(prices[i]-prices[i-1],0);
}
return ret ;
}
};
转载于:https://www.cnblogs.com/ucas/p/5804987.html