zoukankan      html  css  js  c++  java
  • 252. Meeting Rooms

    ...

    M1: time = O(nlogn), space = O(logn) for sorting

    class Solution {
        public boolean canAttendMeetings(int[][] intervals) {
            Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
            for(int i = 0; i + 1 < intervals.length; i++) {
                if(intervals[i + 1][0] < intervals[i][1]) {
                    return false;
                }
            }
            return true;
        }
    }

    M2: define an interval

    /**
     * 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 Solution {
        public boolean canAttendMeetings(Interval[] intervals) {
            Arrays.sort(intervals, (a, b) -> a.start - b.start);
            for(int i = 0; i + 1< intervals.length; i++) {
                if(intervals[i+1].start < intervals[i].end)
                    return false;
            }
            return true;
        }
    }
  • 相关阅读:
    Hibernate优缺点
    Struts优缺点
    Problem M
    Problem K
    Problem K
    Problem Q
    Problem Q
    Problem F
    Problem F
    哈夫曼树
  • 原文地址:https://www.cnblogs.com/fatttcat/p/13959513.html
Copyright © 2011-2022 走看看