-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
436.py
39 lines (39 loc) · 1.48 KB
/
436.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
__________________________________________________________________________________________________
sample 292 ms submission
class Solution:
def findRightInterval(self, intervals: List[List[int]]) -> List[int]:
out = []
if not intervals:
return out
indexmap = {}
starts = [i[0] for i in intervals]
for i, start in enumerate(starts):
indexmap[start] = i
starts.sort()
for start,end in intervals:
if end in indexmap:
out.append(indexmap[end])
else:
i = 0
j = len(starts) - 1
result = None
while i <= j:
mid = (i + j) // 2
if starts[mid] > end:
result = starts[mid]
j = mid - 1
else:
i = mid + 1
out.append(-1 if result is None else indexmap[result])
return out
__________________________________________________________________________________________________
sample 16616 kb submission
class Solution:
def findRightInterval(self, intervals):
l = sorted((e[0], i) for i, e in enumerate(intervals))
res = []
for e in intervals:
r = bisect.bisect_left(l, (e[1],))
res.append(l[r][1] if r < len(l) else -1)
return res
__________________________________________________________________________________________________