NeetCode #830LC-1272MediumIntervalsNC Algo100
← Back to All Problems

#830 · #1272 · Remove Interval(删除区间)

📌 Problem Statement & Constraints

You are given a sorted list of disjoint intervals intervals and an interval toBeRemoved. Return the list of intervals after removing toBeRemoved (the removed part may split an interval in two). Constraints: 1 <= intervals.length <= 10^4, -10^9 <= intervals[i][0] <= intervals[i][1] <= 10^9, sorted and disjoint.
🔒

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!