题目描述
样例
算法1 O(n)
遍历nums[1, n], 对于每个num[i], 求nums[i]-minv (minv是nums[1, i-1]里的最小值), 遍历一遍保留最大即可
‘’‘
class Solution {
public:
int maxDiff(vector[HTML_REMOVED]& nums) {
if(nums.empty()) return 0;
int minv = nums[0], ret = 0;
for(int i=1; i[HTML_REMOVED] minv) ret = max(ret, nums[i]-minv);
minv = min(minv, nums[i]);
}
return ret;
}
};