java:
最开始做的复杂了哈哈哈 感谢题解
class Solution {
public int maximumDifference(int[] nums) {
int n = nums.length;
int min = nums[0];
int ans = -1;
for(int i = 1; i < n; i++){
if(nums[i] > min){
ans = Math.max(ans, nums[i]-min);
}else{
min = nums[i];
}
}
return ans;
}
}
python:
class Solution:
def maximumDifference(self, nums: List[int]) -> int:
n = len(nums)
ans = -1
min = nums[0]
for i in range(1, n):
if nums[i] > min:
ans = max(ans, nums[i]- min)
else:
min = nums[i]
return ans