zoukankan      html  css  js  c++  java
  • 849. Maximize Distance to Closest Person

    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.

    two pointers, time = O(N), space = O(1)

    class Solution {
        public int maxDistToClosest(int[] seats) {
            int maxDist = Integer.MIN_VALUE;
            int j = -1;
            if(seats[0] == 1) {
                j = 0;
            }
            for(int i = 0; i < seats.length; i++) {
                if(seats[i] == 1) {
                    if(j == -1) {
                        maxDist = Math.max(maxDist, i);
                    } else {
                        maxDist = Math.max(maxDist, (i - j) / 2);
                    }
                    j = i;
                }
            }
            if(seats[seats.length - 1] == 0) {
                maxDist = Math.max(maxDist, seats.length - 1 - j);
            }
            return maxDist;
        }
    }
  • 相关阅读:
    Codeforces Round #647 (Div. 2) A
    Acwing 1129. 热浪 解题报告
    二分 + 三分模板
    可持久化线段树(主席树)模板
    《架构之美》-----阅读笔记四
    《架构之美》-----阅读笔记三
    《架构之美》-----阅读笔记二
    《架构之美》-----阅读笔记一
    《软件需求》------阅读笔记三
    《软件需求》------阅读笔记二
  • 原文地址:https://www.cnblogs.com/fatttcat/p/13959440.html
Copyright © 2011-2022 走看看