zoukankan      html  css  js  c++  java
  • Meeting Rooms

    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.

    解法重点:

    sorting array by using Comparator:

    http://stackoverflow.com/questions/37150402/sorting-2d-arrays-using-java-comparator

    /**
     * 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; }
     * }
     */
    public class Solution {
        
        
        public boolean canAttendMeetings(Interval[] intervals) {
            if(intervals==null)return false;
            
            
            Arrays.sort(intervals,new Comparator<Interval>(){
               @Override
                public int compare(Interval a, Interval b){return a.start-b.start;}
            });
            
            for(int i=1;i<intervals.length;i++)
            {
                if(intervals[i].start<intervals[i-1].end)
                return false;
            }
            
            return true;
        }
    }

     reference: 

    Deep Understanding of Arrays.sort()

    http://www.programcreek.com/2013/11/arrays-sort-comparator/

  • 相关阅读:
    JavaScript中的Date对象
    补零函数和随机数函数
    设置与获取自定义属性
    eval()
    获取DOM元素样式
    do{}while() 循环
    ++ 运算符
    switch 语句
    git
    webpack
  • 原文地址:https://www.cnblogs.com/hygeia/p/5700017.html
Copyright © 2011-2022 走看看