class Solution {
public int maxProfit(int[] endurance ) {
if(endurance.length == 0) return 0;
int min = endurance[0], max = min, result = 0;
for(int i=1; i<endurance.length; i++) {
if(endurance[i] < min) {
min = endurance[i];
max = min;
}
else if(endurance[i] > max) max = endurance[i];
if(max - min > result) result = max - min;
}
return result;
}
}
力扣leetcode 121. 买卖股票的最佳时机 java
最新推荐文章于 2021-07-16 15:59:08 发布