Maximize Distance to Closest Person LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxDistToClosest(vector<int> &seats) {
4
    vector<int> d;
5
    int cnt = -1, ans = 0;
6

7
    for (int i = 0; i < seats.size(); i++) {
8
      cnt++;
9
      if (seats[i]) d.push_back(cnt), cnt = 0;
10
    }
11
    d.push_back(cnt);
12

13
    for (int i = 0; i < d.size(); i++) {
14
      if (i > 0 && i < d.size() - 1) d[i] /= 2;
15
      ans = max(ans, d[i]);
16
    }
17

18
    return ans;
19
  }
20
};