[LC] 2274 Maximum Consecutive Floors Without Special Floors

Java

import java.util.Arrays;

/**
 * <a href="https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/">Maximum Consecutive Floors Without Special Floors</a>
 * 数组；排序
 */
class Solution {
    public int maxConsecutive(int bottom, int top, int[] special) {
        Arrays.sort(special);
        int res = Math.max(special[0] - bottom, top - special[special.length - 1]);
        for (int i = 1; i < special.length; i++) {
            res = Math.max(res, special[i] - special[i - 1] - 1);
        }
        return res;
    }
}

Go

import "slices"

func maxConsecutive(bottom int, top int, special []int) int {
    slices.Sort(special)
    res := max(special[0]-bottom, top-special[len(special)-1])
    for i := 1; i < len(special); i++ {
        res = max(res, special[i]-special[i-1]-1)
    }
    return res
}