849. Maximize Distance to Closest Person -----------E

You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed).

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 * 104
• seats[i] is 0 or 1.
• At least one seat is empty.
• At least one seat is occupied.

A:

class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int maxDist = 0,first1 = 0,last1 = seats.size()-1;
        // first check front 
        while(first1<seats.size() && seats[first1] ==0)
            first1++;
        
        // check tail
        while(last1 >=0 && seats[last1] ==0)
            last1--;
        int tmp = seats.size()-1 - last1;
        maxDist = std::max(first1, tmp);
        int start = first1;
        int curCount0 = 0;
        for(int i =first1; i< last1; i++){
            if(seats[i] == 0){
                curCount0++;
                maxDist = std::max(maxDist, (curCount0-1)/2+1);
            }else{
                curCount0 = 0;
            }
        }
        return maxDist;
    }
};

错误：

1：  (curCount0-1)/2    忘了 +1 

2：  
        int tmp = seats.size()-1 - last1;
        maxDist = std::max(first1, tmp);

不能省略 tmp 变量， 否则会有  

C++ leetcode no matching function for call to 'max'         因为max的数据类型不统一。