2019年8月11日
Design HashSet
摘要： Design a HashSet without using any built-in hash table libraries. To be specific, your design should include these functions: add(value): Insert a val 阅读全文
posted @ 2019-08-11 10:20 北叶青藤 阅读(182) 评论(0) 推荐(0)
Design Circular Deque
摘要： Design your implementation of the circular double-ended queue (deque). Your implementation should support following operations: MyCircularDeque(k): Co 阅读全文
posted @ 2019-08-11 09:46 北叶青藤 阅读(227) 评论(0) 推荐(0)
Design Circular Queue
摘要： Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (F 阅读全文
posted @ 2019-08-11 09:02 北叶青藤 阅读(225) 评论(0) 推荐(0)
Design Linked List
摘要： Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list 阅读全文
posted @ 2019-08-11 02:58 北叶青藤 阅读(264) 评论(0) 推荐(0)
Design Phone Directory
摘要： Design a Phone Directory which supports the following operations: get: Provide a number which is not assigned to anyone.check: Check if a number is av 阅读全文
posted @ 2019-08-11 02:21 北叶青藤 阅读(209) 评论(0) 推荐(0)