-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmeeting_rooms_ii.go
43 lines (41 loc) · 1012 Bytes
/
meeting_rooms_ii.go
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
package intervals
import "sort"
func MeetingRoomsII(intervals [][]int) int {
// Special case
if len(intervals) == 0 {
return 0
}
// Total number of intervals
n := len(intervals)
// Arrays to store start and end times
startTimes := make([]int, n)
endTimes := make([]int, n)
for i := 0; i < n; i++ {
startTimes[i] = intervals[i][0]
endTimes[i] = intervals[i][1]
}
// Sort both the arrays
sort.Slice(startTimes, func(i, j int) bool {
return startTimes[i] < startTimes[j]
})
sort.Slice(endTimes, func(i, j int) bool {
return endTimes[i] < endTimes[j]
})
// Total number of meeting rooms required
requiredMeetingRooms := 0
// Meetings in progress
meetingsInProgress := 0
// Pointers to traverse startTimes and endTimes
start, end := 0, 0
for start < n {
if startTimes[start] < endTimes[end] {
meetingsInProgress++
start++
} else {
meetingsInProgress--
end++
}
requiredMeetingRooms = max(requiredMeetingRooms, meetingsInProgress)
}
return requiredMeetingRooms
}