题目来源leetcode
class Solution {
public:
int maximumDifference(vector& nums) {
int ans=-1;
int premin=nums[0];
for (int i=1;ipremin){
ans=max(ans,nums[i]-premin);
}
else{
premin=nums[i];
}
}
return ans;
}
};
固定下j,那么i只能0<=i
如果premin



