DaleStudy#231 Meeting Rooms

Author: forest000014

meeting-rooms/forest000014.java

@@ -0,0 +1,15 @@
+/*
+# Time Complexity: O(nlogn)
+# Space Complexity: O(1)
+*/
+class Solution {
+    public boolean canAttendMeetings(int[][] intervals) {
+        Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
+
+        for (int i = 1; i < intervals.length; i++) {
+            if (intervals[i][0] < intervals[i - 1][1]) return false;
+        }
+
+        return true;
+    }
+}