有更简单的方法
public class Solution {
public int maxProfit(int[] prices) {if(prices.length<2)
return 0;
int max=0;int min=prices[0];int M=0;
for(int i=1;i<=prices.length-1;i++)
{
if(prices[i]<=min)
{
min=prices[i];
}
else
{
M=M+prices[i]-min;
min=prices[i];
}
}
return M;
}
}
public class Solution {
public int maxProfit(int[] prices) {
if(prices.length<2)
{
return 0;
}
int max=0;
for(int i=1;i<=prices.length-1;i++)
{
int M=prices[i]-prices[i-1];
if(M>0)
{
max=max+M;
}
}
return max;
}
}