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

    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.
    class Solution:
        def maxDistToClosest(self, seats):
            """
            :type seats: List[int]
            :rtype: int
            """
            def solve(i):
                count = 1
                left,right = i-1,i+1
                while (left<0 or seats[left]==0) and (right>=len(seats) or seats[right]==0):
                    left -= 1
                    right += 1
                    count += 1
                return count
            res = 1
            for i in range(len(seats)):
                if seats[i]==0:
                    res = max(res,solve(i))
            return res
    
  • 相关阅读:
    手把手教你用Python模拟登录淘宝
    数据库链接方式ORM
    ubuntu命令
    django项目不能运行解决方法
    区别比较 match和search
    redis持久化RDB与AOF
    python基础数据类型
    python基础二
    Python中将一个对象倒序输出的4种方法
    python基础数据类型补充以及编码的进阶
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9775302.html
Copyright © 2011-2022 走看看