https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/
public int maxProfit(int[] prices)
{
int res=0;
for(int i=0;i<prices.length-1;i++)
{
int profit=prices[i+1]-prices[i];
if(profit>0)
{
res+=profit;
}
}
return res;
}
貪心即可