-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathConflictingAppointments.java
More file actions
47 lines (40 loc) · 1.08 KB
/
ConflictingAppointments.java
File metadata and controls
47 lines (40 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
package Leetcode;
import java.util.Arrays;
/**
* @author kalpak
*
* Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.
*
* Example 1:
* Input: intervals = [[0,30],[5,10],[15,20]]
* Output: false
*
* Example 2:
* Input: intervals = [[7,10],[2,4]]
* Output: true
*
* Constraints:
*
* 0 <= intervals.length <= 10^4
* intervals[i].length == 2
* 0 <= start_i < end_i <= 10^6
*
*/
public class ConflictingAppointments {
public static boolean canAttendMeetings(int[][] intervals) {
if(intervals == null)
return false;
if(intervals.length == 0)
return true;
Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
for(int i = 1; i < intervals.length; i++) {
if(intervals[i-1][1] > intervals[i][0])
return false;
}
return true;
}
public static void main(String[] args) {
int[][] intervals = new int[][]{{0, 30}, {5, 10}, {15, 20}};
System.out.println(canAttendMeetings(intervals));
}
}