这道题目考察了如何确定一条直线上的最亮位置，输入是一个二维数组，表示各个街灯及其照明范围。亮度定义为照到的位置数量，目标是找到亮度最大且位置最小的点。题目解法可以通过与LeetCode的370. Range Addition和253. Meeting Rooms II类比，将街灯问题转换为会议室分配问题，通过分析每个街灯的照明范围找出需求最大的时刻。
A perfectly straight street is represented by a number line. The street has street lamp(s) on it and is represented by a 2D integer array lights. Each lights[i] = [positioni, rangei] indicates that there is a street lamp at position positioni that lights up the area from [positioni - rangei, positioni + rangei] (inclusive).
The brightness of a position p is defined as the number of street lamp that light up the position p.
Given lights, return the brightest position on the street. If there are multiple brightest positions, return the smallest one.
Example 1:
Input: lights = [[-3,2],[1,2],[3,3]]
最低0.47元/天 解锁文章
470
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
