Skip to content

Commit 505b08b

Browse files
solves #252: Meeting rooms in java
1 parent 26ca794 commit 505b08b

File tree

2 files changed

+19
-1
lines changed

2 files changed

+19
-1
lines changed

β€ŽREADME.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -220,7 +220,7 @@
220220
| 249 | πŸ”’ [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) | | |
221221
| 250 | πŸ”’ [Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) | | |
222222
| 251 | πŸ”’ [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) | | |
223-
| 252 | πŸ”’ [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | | |
223+
| 252 | πŸ”’ [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | [![Java](assets/java.png)](src/MeetingRooms.java) | |
224224
| 253 | πŸ”’ [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | | |
225225
| 254 | πŸ”’ [Factor Combinations](https://leetcode.com/problems/factor-combinations) | | |
226226
| 255 | πŸ”’ [Verify Preorder Sequence In Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) | | |

β€Žsrc/MeetingRooms.java

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
// https://leetcode.com/problems/meeting-rooms
2+
// T: O(N logN)
3+
// S: O(logN)
4+
5+
import java.util.Arrays;
6+
import java.util.Comparator;
7+
8+
public class MeetingRooms {
9+
public boolean canAttendMeetings(int[][] intervals) {
10+
Arrays.sort(intervals, Comparator.comparingInt(a -> a[0]));
11+
for (int i = 0 ; i < intervals.length - 1 ; i++) {
12+
if (intervals[i][1] > intervals[i + 1][0]) {
13+
return false;
14+
}
15+
}
16+
return true;
17+
}
18+
}

0 commit comments

Comments
 (0)