leetcode python实现 731. My Calendar II

题目传送门：

https://leetcode-cn.com/problems/my-calendar-ii/description/

思路：构造一个字典记录每个数字出现的次数，每次进来一个样本，都先对上次的字典进行备份（万一不通过就回溯）

class MyCalendarTwo:

    def __init__(self):
        self.dic = {}

    def book(self, start, end):
        """
        :type start: int
        :type end: int
        :rtype: bool
        """
        not_continue = self.dic.copy()
        for i in range(start,end):
            if i not in self.dic.keys():
                self.dic[i] = 1
            elif self.dic[i] == 2:
                self.dic = not_continue
                print(self.dic)
                return False
                break
            else:
                self.dic[i] = self.dic[i]+1
        return True