849. Maximize Distance to Closest Person
849. Maximize Distance to Closest Person
Description
You are given an array representing a row of seats
where seats[i] = 1
represents a person sitting in the i^th
seat, and seats[i] = 0
represents that the i^th
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.
Example 1:

1 | Input: seats = [1,0,0,0,1,0,1] |
Example 2:
1 | Input: seats = [1,0,0,0] |
Example 3:
1 | Input: seats = [0,1] |
Constraints:
2 <= seats.length <= 2 * 10^4
seats[i]
is0
or1
.- At least one seat is empty .
- At least one seat is occupied .
Hints/Notes
- 2025/04/17 Q3
- array
- Leetcode solution
Solution
Language: C++
1 | class Solution { |