-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy paths0729_my_calendar_i.go
More file actions
46 lines (38 loc) · 1.21 KB
/
s0729_my_calendar_i.go
File metadata and controls
46 lines (38 loc) · 1.21 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
/*
You are implementing a program to use as your calendar. We can add a new event
if adding the
event will not cause a double booking.
A double booking happens when two events have some non-empty intersection
(i.e., some moment is
common to both events.).
The event can be represented as a pair of integers start and end that
represents a booking on the
half-open interval [start, end), the range of real numbers x such that start <=
x < end.
Implement the MyCalendar class:
MyCalendar() Initializes the calendar object.
boolean book(int start, int end) Returns true if the event can be added to the
calendar successfully
without causing a double booking. Otherwise, return false and do not add the
event to the calendar.
*/
//nolint:revive // it's ok
package solutions
type MyCalendar struct {
intervals [][]int
}
// NewMyCalendar should call Constructor to pass LeetCode tests
func NewMyCalendar() MyCalendar {
return MyCalendar{}
}
func (c *MyCalendar) Book(start, end int) bool {
// todo: this is a poor solution.
// it could be a BST
for _, v := range c.intervals {
if v[0] < end && start < v[1] {
return false
}
}
c.intervals = append(c.intervals, []int{start, end})
return true
}