LeetCode.729 My Calendar I

题目:

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 {
        //给定日期安排行程,当不发生冲突时,返回true,否则返回false
        //思路:类似甘特图,采用数组才记录每次起始位置
        
        //注意:测试对不超过一千对,起始和终止的范围【0,10^9】
        
        //创建一个数组容器来存储满足条件的例程
        int [][] compare=new int[1000][2];
        //用来记录已经添加的条数
        int count;
        public MyCalendar() {
            count=0;
        }
        
        public boolean book(int start, int end) {
        
            //遍历已经存储的记录表
            for(int i=0;i<count;i++){
                //求少不求多,假设不存在交集
                if(!(start>=compare[i][1]||end<=compare[i][0])){
                    return false;
                }
            }
            //说明不存在冲突
            compare[count][0]=start;
            compare[count][1]=end;
            count++;
            
            return true;
        }
    }
    
    /**
     * Your MyCalendar object will be instantiated and called as such:
     * MyCalendar obj = new MyCalendar();
     * boolean param_1 = obj.book(start,end);
     */


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值