LeetCode-Maximize Distance to Closest Person

Description:
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 <= 20000
seats contains only 0s or 1s, at least one 0, and at least one 1.

题意：给定一个只包含0和1的一维数组，其中，0表示这是一个空位子，1表示这个位子已经有人坐了，要求找出一个空位子，使得这个位子距离左右两边有人的位子的距离最大；

解法：要使得距离左右两边的距离尽量大，我们可以用一个数组保存当前空位子距离左右两边的距离，这样，我们只需要比较各自的距离就可以得到最大的那个距离的位子；

class Solution {
    public int maxDistToClosest(int[] seats) {
        int[] leftOne = new int[seats.length];
        int[] rightOne = new int[seats.length];
        int maxLen = 20000;
        int posOne = -maxLen;
        int maxDist = 0;
        for (int i = 0; i < seats.length; i++) {
            if (seats[i] == 1) {
                posOne = i;
            } else {
                leftOne[i] = i - posOne;
            }
        }
        posOne = maxLen;
        for (int i = seats.length - 1; i >=0; i--) {
            if (seats[i] == 1) {
                posOne = i;
            } else {
                rightOne[i] = posOne - i;
            }
        }
        for (int i = 0; i < seats.length; i++) {
            if (seats[i] == 0) {
                maxDist = Math.max(maxDist, Math.min(leftOne[i], rightOne[i]));
            }
        }
        return maxDist;
    }
}