Leetcode Problem 849. Maximize Distance to Closest Person

849. Maximize Distance to Closest Person

Leetcode Solutions

Approach #: Next Array

  1. Initialize two arrays left and right of the same length as seats, filled with zeros.
  2. 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.
  3. 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.
  4. Iterate over all seats i and for each empty seat, calculate min(left[i], right[i]).
  5. Return the maximum value from step 4.
UML Thumbnail

Approach #: Group by Zero

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...