Leetcode Problem 849. Maximize Distance to Closest Person

849. Maximize Distance to Closest Person

Leetcode Solutions

Initialize two arrays left and right of the same length as seats, filled with zeros.
Iterate over seats from left to right:
- If seats[i] is 1, set left[i] to 0.
- Otherwise, set left[i] to left[i-1] + 1, with left[0] set to a large number if seats[0] is 0.
Iterate over seats from right to left:
- If seats[i] is 1, set right[i] to 0.
- Otherwise, set right[i] to right[i+1] + 1, with right[-1] set to a large number if seats[-1] is 0.
Iterate over all seats i and for each empty seat, calculate min(left[i], right[i]).
Return the maximum value from step 4.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen