feat: add java solution to lc problem: NO.0729. My Calendar I (doocs#549)

Author: hongyiheng

solution/0700-0799/0729.My Calendar I/README.md

@@ -55,7 +55,23 @@ MyCalendar.book(20, 30); // returns true
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class MyCalendar {
+    List<int[]> calendar;
+
+    MyCalendar() {
+        calendar = new ArrayList<>();
+    }
+
+    public boolean book(int start, int end) {
+        for (int[] item : calendar) {
+            if (item[0] < end && item[1] > start) {
+                return false;
+            }
+        }
+        calendar.add(new int[]{start, end});
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0729.My Calendar I/README_EN.md

@@ -78,7 +78,23 @@ The third event can be booked, as the first event takes every time less than 20,
 ### **Java**
 
 ```java
-
+class MyCalendar {
+    List<int[]> calendar;
+
+    MyCalendar() {
+        calendar = new ArrayList<>();
+    }
+
+    public boolean book(int start, int end) {
+        for (int[] item : calendar) {
+            if (item[0] < end && item[1] > start) {
+                return false;
+            }
+        }
+        calendar.add(new int[]{start, end});
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0729.My Calendar I/Solution.java

@@ -0,0 +1,17 @@
+class MyCalendar {
+    List<int[]> calendar;
+
+    MyCalendar() {
+        calendar = new ArrayList<>();
+    }
+
+    public boolean book(int start, int end) {
+        for (int[] item : calendar) {
+            if (item[0] < end && item[1] > start) {
+                return false;
+            }
+        }
+        calendar.add(new int[]{start, end});
+        return true;
+    }
+}