简单版本的
JobHopper-MinMeetingRooms_laserljy123的博客-CSDN博客
同一个 model,问题稍微不同。如果一个人能都 attend,代表每个 interval 之间有 gap (或者相等),所以就 依次比较 相邻两个 interval 是否 cross。
from typing import List
class Solution:
def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
if len(intervals) in [0, 1]:
return True
intervals.sort(key=lambda x: x[0])
right = intervals[0][1]
for interval in intervals[1:]:
if right > interval[0]:
return False
else:
right = interval[1]
return True
def main():
solution = Solution()
intervals = [[1, 2], [3, 4], [5, 6]]
expected = True
assert(solution.canAttendMeetings(intervals)==expected)
if __name__ == "__main__":
main()