首页 > itarticle > algorithm notes: leetcode#252 meeting rooms

algorithm notes: leetcode#252 meeting rooms

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

# class Interval:
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e
class :
    def canAttendMeetings(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: bool
        """
        intervals.sort(key=lambda a: a.start)
        for i in range(len(intervals)-1):
            if intervals[i].end > intervals[i+1].start:
                return False
        return True

Java implementation

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
class  {
    public boolean canAttendMeetings(Interval[] intervals) {
        Arrays.sort(intervals, new Comparator<Interval>() {
            public int compare(Interval i1, Interval i2){
                return i1.start - i2.start;
            }
        });
        
        for(int i = 0; i < intervals.length - 1; i++)
            if(intervals[i].end > intervals[i+1].start)
                return false;
        return true;
    }
}

Time complexity

O(nlogn).

Space complexity

O(1).

Links

252. Meeting Rooms