Welcome to Subscribe On Youtube
Formatted question description: https://leetcode.ca/all/849.html
849. Maximize Distance to Closest Person (Medium)
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 (0indexed).
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:
Input: seats = [1,0,0,0,1,0,1] Output: 2 Explanation: 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.
Example 2:
Input: seats = [1,0,0,0] Output: 3 Explanation: 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.
Example 3:
Input: seats = [0,1] Output: 1
Constraints:
2 <= seats.length <= 2 * 10^{4}
seats[i]
is0
or1
. At least one seat is empty.
 At least one seat is occupied.
Related Topics:
Array
Similar Questions:
Solution 1.
// OJ: https://leetcode.com/problems/maximizedistancetoclosestperson/
// Time: O(N)
// Space: O(1)
class Solution {
public:
int maxDistToClosest(vector<int>& A) {
int start = 1, N = A.size(), ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] == 0) continue;
if (start == 1) ans = i;
else ans = max(ans, (i  start) / 2);
start = i;
}
if (A.back() == 0) ans = max(ans, N  1  start);
return ans;
}
};
Java

class Solution { public int maxDistToClosest(int[] seats) { int length = seats.length; int leftMostOne = 1, rightMostOne = length; for (int i = 0; i < length; i++) { if (seats[i] == 1) { leftMostOne = i; break; } } for (int i = length  1; i >= 0; i) { if (seats[i] == 1) { rightMostOne = i; break; } } int maxDistance = Math.max(leftMostOne, length  1  rightMostOne); int prevOne = leftMostOne; for (int i = leftMostOne; i <= rightMostOne; i++) { if (seats[i] == 1) { int onesDistance = i  prevOne; int curDistance = onesDistance / 2; maxDistance = Math.max(maxDistance, curDistance); prevOne = i; } } return maxDistance; } }

// OJ: https://leetcode.com/problems/maximizedistancetoclosestperson/ // Time: O(N) // Space: O(1) class Solution { public: int maxDistToClosest(vector<int>& A) { int start = 1, N = A.size(), ans = 0; for (int i = 0; i < N; ++i) { if (A[i] == 0) continue; if (start == 1) ans = i; else ans = max(ans, (i  start) / 2); start = i; } if (A.back() == 0) ans = max(ans, N  1  start); return ans; } };

class Solution: def maxDistToClosest(self, seats: List[int]) > int: first = last = None d = 0 for i, c in enumerate(seats): if c: if last is not None: d = max(d, i  last) if first is None: first = i last = i return max(first, len(seats)  last  1, d // 2) ############ class Solution(object): def maxDistToClosest(self, seats): """ :type seats: List[int] :rtype: int """ index = 200000 _len = len(seats) ans = [0] * _len for i in range(_len): if seats[i] == 1: index = i else: ans[i] = abs(i  index) index = 200000 for i in range(_len  1, 1, 1): if seats[i] == 1: index = i else: ans[i] = min(abs(i  index), ans[i]) return max(ans)