Leetcode: Meeting Rooms

## https://code.dennyzhang.com/meeting-rooms
## Basic Ideas:
##
## Complexity: Time O(n*log(n)), Space O(1)
##
# Definition for an interval.
# class Interval:
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e

class Solution:
    def canAttendMeetings(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: bool
        """
        length = len(intervals)
        if length <= 1: return True
        intervals.sort(key=lambda x: x.start)
        for i in range(1, length):
            if intervals[i].start < intervals[i-1].end:
                return False
        return True