class MyCalendar {
var orderArray:[[Int]]
init() {
orderArray = []
}
func book(_ start: Int, _ end: Int) -> Bool {
for temp in orderArray {
if (start < temp[1] && end > temp[0]){
return false
}
}
orderArray.append([start,end])
return true
}
}
剑指 Offer II 042. 最近请求次数[https://leetcode-cn.com/problems/...
剑指 Offer II 024. 反转链表[https://leetcode.cn/problems/UHnkqh...
剑指 Offer II 027. 回文链表[https://leetcode-cn.com/problems/aM...
LeetCode 面试题32 - II. 从上到下打印二叉树 II【剑指Offer】【Easy】【Python】【...
剑指 Offer II 098. 路径的数目[https://leetcode-cn.com/problems/2...
剑指 Offer 59 - II. 队列的最大值https://leetcode-cn.com/problems/...
剑指 Offer II 018. 有效的回文[https://leetcode-cn.com/problems/X...
剑指 Offer II 029. 排序的循环链表[https://leetcode-cn.com/problems...
剑指 Offer II 033. 变位词组[https://leetcode.cn/problems/sfvd7V...
本文标题：剑指 Offer II 058. 日程表
本文链接：https://www.haomeiwen.com/subject/gilumrtx.html
网友评论