class Solution {
public int maxDiff(int[] nums) {
if(nums==null||nums.length==0)
return 0;
int lirun=0;
int min=nums[0];
int maxlirun=0;
for(int i=1;i[HTML_REMOVED]maxlirun)
maxlirun=lirun;
}
return maxlirun;
}
}