Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int maxDistToClosest(vector<int>& seats) {
- int n = seats.size(), last = -1, ans = 0;
- for (int i = 0; i < n; i++) {
- if (seats[i] == 1) {
- if (last == -1) ans = max(ans, i);
- else ans = max(ans, (i - last) / 2);
- last = i;
- }
- }
- ans = max(ans, n - last - 1);
- return ans;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement