252. Meeting Rooms

[Shawngbk]

/**

• 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; // Sort the intervals by start time Arrays.sort(intervals, new Comparator() { public int compare(Interval i, Interval j) { return i.start - j.start; } }); for(int i = 1; i < intervals.length; i++) { if(intervals[i].start < intervals[i-1].end) return false; } return true; } }

方法二：利用start<end的特性，分别对start和end进行排序。 [java] view plain copy /\

• 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) {
  int[] starts = new int[intervals.length];
  int[] ends = new int[intervals.length];
  for(int i=0; i<intervals.length; i++) {
  starts[i] = intervals[i].start;
  ends[i] = intervals[i].end;
  }
  Arrays.sort(starts);
  Arrays.sort(ends);
  for(int i=1; i<intervals.length; i++) {
  if (ends[i-1] > starts[i]) return false;
  }
  return true;
  }
  }

[Shawngbk]

FB