[week3] solve 252. Meeting Rooms

Author: bky373

meeting-rooms/bky373.java

@@ -0,0 +1,19 @@
+class Solution {
+
+    public boolean canAttendMeetings(int[][] intervals) {
+        if (intervals.length == 0) {
+            return true;
+        }
+        Arrays.sort(intervals, (o1, o2) -> o1[0] - o2[0]);
+        for (int i = 0; i < intervals.length - 1; i++) {
+            if (intervals[i][1] > intervals[i + 1][0]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+/**
+ * TC: O(nlogn), due to the sorting array.
+ * SC: O(1)
+ */