849. Maximize Distance to Closest Person ——weekly contest 87

849. Maximize Distance to Closest Person

题目链接：https://leetcode.com/problems/maximize-distance-to-closest-person/description/

思路：pre[i]存放i之前离最近的1的距离。post记录之后的。 res = max(min(pre[i],[post[i]))

注意点：初始nst需要设计极大或极小值。

 

int maxDistToClosest(vector<int>& seats) {
        vector<int> pre,post;
        int n = seats.size();
        pre.assign(n,0);
        post.assign(n,0);
        int nst = -200000;
        for(int i = 0; i < n; i++){
            if(seats[i] == 1){
                nst = i;
            }else{
                pre[i] = i - nst;
            }
        }
        nst = 200000;
        for(int i = n - 1; i >= 0; i--){
            if(seats[i]==1){
                nst = i;
            }else{
                post[i] = nst - i;
            }
        }
        int res = 0;
        for(int i = 0; i<n; i++ ){
            int temp = min(pre[i],post[i]);
            res = max(res,temp);
        }
        return res;
    }