中等题重拳出击
排序+遍历就可以
293场周赛
class Solution {
public int maxConsecutive(int bottom, int top, int[] special) {
Arrays.sort(special);
int ans = special[0] - bottom;
int d = special[0];
for(int i = 0; i < special.length; i ++){
ans = Math.max(ans, special[i] - d - 1);
d = special[i];
}
ans = Math.max(top - d, ans);
return ans;
}
}



