Maximize Distance to Closest Person, two-scans solution
Problem is here: https://leetcode.com/problems/maximize-distance-to-closest-person/description/
The easiest way to solve this problem is to do two scans: first go from L => R and set the min distance from an empty seat to a taken seat. Then move the other direction, R => L, doing the same thing. But, in the second pass (since it is the last), keep track of the max distance too. O(n)-space, O(n)-time. Cheers, Marcelo.
In a row of
seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty.
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 closest person.
Example 1:
Input: [1,0,0,0,1,0,1] Output: 2 Explanation: If Alex sits in the second open seat (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.
Example 2:
Input: [1,0,0,0] Output: 3 Explanation: If Alex sits in the last seat, the closest person is 3 seats away. This is the maximum distance possible, so the answer is 3.
Note:
1 <= seats.length <= 20000seatscontains only 0s or 1s, at least one0, and at least one1.
The easiest way to solve this problem is to do two scans: first go from L => R and set the min distance from an empty seat to a taken seat. Then move the other direction, R => L, doing the same thing. But, in the second pass (since it is the last), keep track of the max distance too. O(n)-space, O(n)-time. Cheers, Marcelo.
public class Solution
{
public int MaxDistToClosest(int[] seats)
{
int[] min = new int[seats.Length];
int oo = Int32.MaxValue;
//Base
for (int i = 0; i < min.Length; i++) min[i] = oo;
//"Construction"
int max = 0;
//1.L->R
int anchor = -1;
for (int i = 0; i < min.Length; i++)
{
if (seats[i] == 1) anchor = i;
else if (anchor != -1) min[i] = Math.Min(min[i], i - anchor);
}
//2.R->L
anchor = -1;
for (int i = min.Length - 1; i >= 0; i--)
{
if (seats[i] == 1) anchor = i;
else if (anchor != -1) min[i] = Math.Min(min[i], anchor - i);
max = (min[i] != oo) ? Math.Max(max, min[i]) : max;
}
return max;
}
}
It's interesting to see how many different ways are there to think about this problem. I thought about it in a following way - there are 3 cases to consider - sitting at the very left or very right seat or between 2 other chairs. First 2 can be found by doing a linear search for the very first taken seat and the last case can be handled by finding the biggest "gap" between 2 chairs and dividing it by 2:
ReplyDeleteclass Solution:
def maxDistToClosest(self, seats):
"""
:type seats: List[int]
:rtype: int
"""
max_gap, current_gap = 0, 0
for seat in seats:
current_gap = 0 if seat == 1 else current_gap + 1
max_gap = max(max_gap, current_gap)
return max(seats.index(1), math.ceil(max_gap / 2), seats[::-1].index(1))
This results in O(N) time and O(1) space complexity.
Cheers,
Taras