动态规划
public class Solution {public int maxProfit(int[] prices) {
if(prices.length<2)
{
return 0;
}
int max=0,min=prices[0], M=0;
for(int i=1;i<=prices.length-1;i++)
{
if(prices[i]<=min)
{
min=prices[i];
}
else
{
M=prices[i]-min;
if(M>max)
{
max=M;
}
}
}
return max;
}
}