Leetcode
2020.04.15 14:10

729. My Calendar I

조회 수 91 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.

Your class will have the method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.

double booking happens when two events have some non-empty intersection (ie., there is some time that is common to both events.)

For each call to the method MyCalendar.book, return 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.

Your class will be called like this: MyCalendar cal = new MyCalendar(); MyCalendar.book(start, end)

Example 1:

MyCalendar();
MyCalendar.book(10, 20); // returns true
MyCalendar.book(15, 25); // returns false
MyCalendar.book(20, 30); // returns true
Explanation: 
The first event can be booked.  The second can't because time 15 is already booked by another event.
The third event can be booked, as the first event takes every time less than 20, but not including 20.

 

Note:

  • The number of calls to MyCalendar.book per test case will be at most 1000.
  • In calls to MyCalendar.book(start, end)start and end are integers in the range [0, 10^9].


class MyCalendar {
    List<int[]> list;
    
    public MyCalendar() {
        list = new ArrayList<>();
    }
    
    public boolean book(int start, int end) {
        //for(int i=0; i<list.size(); i++){
        //    int[] item = list.get(i);
        for(int[] item : list){
            if(item[1]>start && end>item[0]){
                return false;
            }    
        }
        
        list.add(new int[]{start,end});
        return true;
    }
}

/**
 * Your MyCalendar object will be instantiated and called as such:
 * MyCalendar obj = new MyCalendar();
 * boolean param_1 = obj.book(start,end);
 */

[문제] https://leetcode.com/problems/my-calendar-i/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Programmers hashmap secret hooni 2020.04.30 0
76 Programmers fib secret hooni 2020.04.30 0
75 Programmers team game secret hooni 2020.04.30 0
74 Leetcode 692. Top K Frequent Words hooni 2020.04.15 80
73 Leetcode 2. Add Two Numbers hooni 2020.04.14 83
72 Leetcode 731. My Calendar II hooni 2020.04.15 87
71 Leetcode 75. Sort Colors hooni 2020.04.14 88
70 Leetcode 347. Top K Frequent Elements hooni 2020.04.14 89
69 Leetcode 20. Valid Parentheses hooni 2020.04.25 89
68 Leetcode 430. Flatten a Multilevel Doubly Linked List file hooni 2020.04.06 91
67 Leetcode 23. Merge k Sorted Lists hooni 2020.04.14 91
» Leetcode 729. My Calendar I hooni 2020.04.15 91
65 Leetcode 253. Meeting Rooms II hooni 2020.04.15 91
64 Leetcode 7. Reverse Integer hooni 2020.04.28 91
63 Leetcode 62. Unique Paths file hooni 2020.04.09 92
62 Leetcode 350. Intersection of Two Arrays II hooni 2020.04.28 92
61 Leetcode 852. Peak Index in a Mountain Array hooni 2020.04.28 92
60 Leetcode 946. Validate Stack Sequences hooni 2020.04.08 94
59 Leetcode 973. K Closest Points to Origin hooni 2020.04.15 94
58 Leetcode 443. String Compression hooni 2020.04.25 94
Board Pagination Prev 1 2 3 4 Next
/ 4