Maximum Consecutive Floors Without Special Floors LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxConsecutive(int bottom, int top, vector<int> &special) {
4
    int res(0), n(size(special));
5
    sort(begin(special), end(special));
6

7
    for (int i = 1; i < n; i++) {
8
      res = max(res, special[i] - special[i - 1] - 1);
9
    }
10

11
    return max({res, special[0] - bottom, top - special[n - 1]});
12
  }
13
};