You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the i<sup>th</sup> seat, and seats[i] = 0 represents that the i<sup>th</sup> seat is empty (0-indexed).There is at least one empty seat, and at least one person sitting.Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized.Return that maximum distance to the closest person.
Input: seats = [1,0,0,0,1,0,1]Output: 2Explanation:If Alex sits in the second open seat (i.e. seats[2]), then the closest person has distance 2.If Alex sits in any other open seat, the closest person has distance 1.Thus, the maximum distance to the closest person is 2.
Input: seats = [1,0,0,0]Output: 3Explanation:If Alex sits in the last seat (i.e. seats[3]), the closest person is 3 seats away.This is the maximum distance possible, so the answer is 3.
class Solution: # Time: O(n) # Space: O(1) def max_dist_to_closest(self, seats: list[int]) -> int: best = 0 prev = -1 n = len(seats) for i, occupied in enumerate(seats): if occupied: best = i if prev < 0 else max(best, (i - prev) // 2) prev = i return max(best, n - 1 - prev)
