g0801_0900.s0849_maximize_distance_to_closest_person.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0801_0900.s0849_maximize_distance_to_closest_person;
// #Medium #Array #2022_03_24_Time_1_ms_(100.00%)_Space_44_MB_(92.64%)
public class Solution {
private int maxDist = 0;
public int maxDistToClosest(int[] seats) {
for (int i = 0; i < seats.length; i++) {
if (seats[i] == 0) {
extend(seats, i);
}
}
return maxDist;
}
private void extend(int[] seats, int position) {
int left = position - 1;
int right = position + 1;
int leftMinDistance = 1;
while (left >= 0) {
if (seats[left] == 0) {
leftMinDistance++;
left--;
} else {
break;
}
}
int rightMinDistance = 1;
while (right < seats.length) {
if (seats[right] == 0) {
rightMinDistance++;
right++;
} else {
break;
}
}
int maxReach;
if (position == 0) {
maxReach = rightMinDistance;
} else if (position == seats.length - 1) {
maxReach = leftMinDistance;
} else {
maxReach = Math.min(leftMinDistance, rightMinDistance);
}
maxDist = Math.max(maxDist, maxReach);
}
}