[LeetCode] 252. Meeting Rooms_Easy tag: Sort
2018-08-16 10:11 Johnson_强生仔仔 阅读(206) 评论(0) 编辑 收藏 举报Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...]
(si < ei), determine if a person could attend all meetings.
Example 1:
Input: [[0,30],[5,10],[15,20]]
Output: false
Example 2:
Input: [[7,10],[2,4]] Output: true
基本思路就是O(n^2)的方式, imporve就是O(nlgn) 排序咯.
Code
# 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 """ intervals.sort(key = lambda x: x.start) for i in range(1, len(intervals)): if intervals[i].start < intervals[i-1].end: return False return True