Leetcode: Meeting Rooms

Question

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.

For example,
Given [[0, 30],[5, 10],[15, 20]],
return false.

Hide Tags Sort
Hide Similar Problems

My Solution

# Definition for an interval.
# class Interval(object):
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e

class Solution(object):
    def canAttendMeetings(self, intervals):
        """ :type intervals: List[Interval] :rtype: bool """

        dictn = {}
        for elem in intervals:
            if elem.start in dictn:
                dictn[elem.start] += [elem.end]
            else:
                dictn[elem.start] = [elem.end]

        allkey = dictn.keys()
        allkey.sort()
        for ind in range(len(allkey)-1):
            if len( dictn[allkey[ind]] )>1 or len( dictn[allkey[ind+1]] )>1:   # for the case that two meetings start at the same time. 
                return False

            a = dictn[allkey[ind]]
            b = allkey[ind+1]
            if a[0] > b:
                return False

        return True