feat: add python and java solutions to leetcode problem: No.0252

Author: yanglbme

solution/0200-0299/0252.Meeting Rooms/README.md

@@ -30,15 +30,29 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
+        intervals.sort(key=lambda x: x[0])
+        for i in range(len(intervals) - 1):
+            if intervals[i][1] > intervals[i + 1][0]:
+                return False
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean canAttendMeetings(int[][] intervals) {
+        Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
+        for (int i = 0, n = intervals.length; i < n - 1; ++i) {
+            if (intervals[i][1] > intervals[i + 1][0]) return false;
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0252.Meeting Rooms/README_EN.md

@@ -29,13 +29,27 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
+        intervals.sort(key=lambda x: x[0])
+        for i in range(len(intervals) - 1):
+            if intervals[i][1] > intervals[i + 1][0]:
+                return False
+        return True
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean canAttendMeetings(int[][] intervals) {
+        Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
+        for (int i = 0, n = intervals.length; i < n - 1; ++i) {
+            if (intervals[i][1] > intervals[i + 1][0]) return false;
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0252.Meeting Rooms/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public boolean canAttendMeetings(int[][] intervals) {
+        Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
+        for (int i = 0, n = intervals.length; i < n - 1; ++i) {
+            if (intervals[i][1] > intervals[i + 1][0]) return false;
+        }
+        return true;
+    }
+}

solution/0200-0299/0252.Meeting Rooms/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
+        intervals.sort(key=lambda x: x[0])
+        for i in range(len(intervals) - 1):
+            if intervals[i][1] > intervals[i + 1][0]:
+                return False
+        return True