代码
- 参考: 官方解析
int maxProfit(int* prices, int pricesSize){
int min = 0;
int maxpro = 0;
int i;
for( i = 0; i < pricesSize; i++){
if(i == 0){
min = prices[i];
}
else if(prices[i] < min){
min = prices[i];
}
if(prices[i] - min > maxpro){
maxpro = prices[i] - min;
}
}
return maxpro;
}