今際の国の呵呵君
Sunday, July 29, 2018
[LeetCode]Meeting Rooms
题目链接
只要按start time sort然后看所有interval是不是两两不相交即可。时间复杂度O(n * log n),代码如下:
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment