add for sort

Author: houbb

src/main/java/com//houbb/leetcode/datastruct/array/T252_meetingRoom_V1_BF.java

@@ -0,0 +1,30 @@
+package com..houbb.leetcode.datastruct.array;
+
+public class T252_meetingRoom_V1_BF {
+
+public static boolean canAttendMeetings(int[][] intervals) {
+int n = intervals.length;
+
+// 双重循环检查每一对会议是否重叠
+for (int i = 0; i < n; i++) {
+for (int j = i + 1; j < n; j++) {
+// 检查会议 intervals[i] 和 intervals[j] 是否重叠
+if (intervals[i][1] > intervals[j][0] && intervals[j][1] > intervals[i][0]) {
+return false; // 找到重叠会议，返回 false
+}
+}
+}
+
+// 没有重叠会议
+return true;
+}
+
+public static void main(String[] args) {
+int[][] intervals1 = {{0, 30}, {5, 10}, {15, 20}};
+System.out.println("Test case 1: " + canAttendMeetings(intervals1)); // 输出：false
+
+int[][] intervals2 = {{7, 10}, {2, 4}};
+System.out.println("Test case 2: " + canAttendMeetings(intervals2)); // 输出：true
+}
+
+}

src/main/java/com//houbb/leetcode/datastruct/array/T252_meetingRoom_V2_Sort.java

@@ -0,0 +1,33 @@
+package com..houbb.leetcode.datastruct.array;
+
+import java.util.Arrays;
+import java.util.Comparator;
+
+public class T252_meetingRoom_V2_Sort {
+
+public static boolean canAttendMeetings(int[][] intervals) {
+int n = intervals.length;
+
+Arrays.sort(intervals, Comparator.comparingInt(o -> o[0]));
+
+// 双重循环检查每一对会议是否重叠
+for (int i = 1; i < n; i++) {
+// 本次开始 上一次还没有结束
+if(intervals[i][0] < intervals[i-1][1]) {
+return false;
+}
+}
+
+// 没有重叠会议
+return true;
+}
+
+public static void main(String[] args) {
+int[][] intervals1 = {{0, 30}, {5, 10}, {15, 20}};
+System.out.println("Test case 1: " + canAttendMeetings(intervals1)); // 输出：false
+
+int[][] intervals2 = {{7, 10}, {2, 4}};
+System.out.println("Test case 2: " + canAttendMeetings(intervals2)); // 输出：true
+}
+
+}