435. 无重叠区间
解题思路L(贪心) 先排序
再对重叠区间做出判断
在重叠区间中,统计结果并更新右边界
class Solution:
def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
if len(intervals) == 0:return 0
res = 0
intervals.sort(key = lambda x:(x[0],x[1]))
for i in range(1,len(intervals)):
if intervals[i-1][1] > intervals[i][0]:
res += 1
intervals[i][1] = min(intervals[i][1],intervals[i-1][1])
return res
763.划分字母区间
解题思路:(贪心)
先记录每个元素出现的最远距离
再根据最远距离确定分界线
class Solution:
def partitionLabels(self, s: str) -> List[int]:
# 记录每个元素出现的最远距离
hash = [0] * 26
for i in range(len(s)):
hash[ord(s[i]) - ord('a')] = i
#根据最远距离确定分界线
res = []
left = 0
right = 0
for j in range(len(s)):
right = max(right,hash[ord(s[j])- ord('a')])
if j == right:
res.append(right - left +1)
left = j + 1
return res
56. 合并区间
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
intervals.sort(key = lambda x:x[0])
res = [intervals[0]]
for i in range(1,len(intervals)):
last = res[-1]
if last[1] >= intervals[i][0]:
res[-1] = [last[0],max(last[1],intervals[i][1])]
else:
res.append(intervals[i])
return res