[LeetCode]849. Maximize Distance to Closest Person 解题报告(C++)

[LeetCode]849. Maximize Distance to Closest Person 解题报告(C++)

题目描述

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

题目大意

• 给定一个 0 和 1 组成的座位. 0 表示空 1 表示有人.
• 找到一个座位使得其距离人最远.
• 返回最远距离.

解题思路

方法1:

• 本质呢.就是统计最长0的个数.
• 但是问题所在在于 连续0 出现的位置.
• 若在左右.最远距离.即为0的个数.
• 若在中间. 即 1000001 这样. 最远距离 = (连续0的个数+1)/2;

代码实现:

class Solution {
public:
    int maxDistToClosest(vector<int>& seats) {
        int n = seats.size();
        int res = 0;
        int i=0,zero = 0;
        // 统计中间连续0: 10001
        for (i = 0, zero = 0; i < n; ++i) {
            if (seats[i] == 1) {
                zero = 0;
            }
            else {
                res = max(res, (++zero + 1) / 2);
            }
        }
        // 统计左边连续0
        for (i = 0, zero = 0; i < n&&seats[i] == 0; i++) {
            res = max(res, ++zero);
        }
        // 统计右边连续0
        for (i = n - 1, zero = 0; i > 0 && seats[i] == 0; --i) {
            res = max(res, ++zero);
        }
        return res;
    }
};

小结

• -