LC.P849[到最近的人的最大距离]

发表于2023-08-22|更新于2023-08-23|LeetCode

|字数总计:104|阅读时长:1分钟|阅读量:

方法一：贪心

class Solution {
    public int maxDistToClosest(int[] seats) {
        int last = -1, d = 0, n = seats.length, ans = 1;
        for (int i = 0; i < n; ++i) {
            if (seats[i] == 1) {
                if (last == -1) ans = Math.max(ans, i); // 坐左边
                else ans = Math.max(ans, (i - last) / 2); // 坐中间
                last = i;
            }
        }
        ans = Math.max(ans, n - last - 1); // 坐右边
        return ans;
    }
}