循环队列
memcpy0
希望探索文理结合的自由之路。
展开
-
LeetCode C++ 641. Design Circular Deque【设计/队列】中等
Design your implementation of the circular double-ended queue (deque). Your implementation should support following operations: MyCircularDeque(k) : Constructor, set the size of the deque to be k . insertFront() : Adds an item at the front of Deque. Retur原创 2020-10-02 17:10:20 · 158 阅读 · 0 评论 -
LeetCode C++ 622. 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 (First In First Out) principle and the last position is connected back to the first position to make a circl原创 2020-10-02 17:00:49 · 151 阅读 · 0 评论