Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- def intervalIntersection(self, a: List[List[int]], b: List[List[int]]) -> List[List[int]]:
- ans = []
- ai = 0
- bi = 0
- while ai < len(a) and bi < len(b):
- if a[ai][1] < b[bi][0]:
- ai += 1
- continue
- if b[bi][1] < a[ai][0]:
- bi += 1
- continue
- ans.append(
- [max(a[ai][0], b[bi][0]), min(a[ai][1], b[bi][1])]
- )
- if a[ai][1] < b[bi][1]:
- ai += 1
- else:
- bi += 1
- return ans
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement