NeetCode #160LC-2021MediumArrays & Hashing
← Back to All Problems

#160 · #2021 · Brightest Position on Street(街上最亮的位置)

📌 Problem Statement & Constraints

There is a street with positions on a number line. Each lights[i] = [position, range] describes a lamp that illuminates the closed interval [position - range, position + range]. Return the brightest position; on ties, return the smallest such position. Constraints: 1 <= lights.length <= 10^5, -10^8 <= position, range <= 10^8.
🔒

Sign In to Unlock Full Solutions for All 973 Problems

Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!