849. Maximize Distance to Closest Person（python+cpp）

题目：

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.

解释：
这是一个系列题目，都是从左向右遍历一遍，从右向左遍历一遍。
对于每一个位置，都求其左边距离其最近的1和其右边距离其最近的1与其的距离，保留两者这之间较小的值，就代表这个位置的“安全距离”，最终返回所有的位置距离中最大的值即可。
类似的题目有
855. Exam Room
821. Shortest Distance to a Character
python代码：

class Solution(object):
    def maxDistToClosest(self, seats):
        """
        :type seats: List[int]
        :rtype: int
        """
        result=[]
        pre=float('-inf')
        for i in range(len(seats)):
            if seats[i]==1:
                pre=i
            result.append(i-pre)
        pre=float('inf')
        for i in range(len(seats)-1,-1,-1):
            if seats[i]==1:
                pre=i
            result[i]=min(result[i],pre-i)
        return  max(result)

c++代码：

class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int pre=-2001;
        int n=seats.size();
        vector<int>result;
        for(int i=0;i<n;i++)
        {
            if (seats[i]==1)
                pre=i;
            result.push_back(i-pre);
            
        }
        pre=2001;
        for(int i=n-1;i>=0;i--)
        {
            if (seats[i]==1)
                pre=i;
            result[i]=min(result[i],pre-i);
        }
        return *max_element(result.begin(),result.end());
    }
};

总结：
左右遍历是一种很经典的解法，注意变量pre的初始化。