<deque>
A deque (double ended queue) is just like a vector, but optimized for adding and removing elements at either end in O(1) time. It lacks reserve() and capacity() and adds v.push_front(x) // v.insert(v.begin(), x)
v.pop_front() // v.erase(v.begin())
A deque (double ended queue) is just like a vector, but optimized for adding and removing elements at either end in O(1) time. It lacks reserve() and capacity() and adds v.push_front(x) // v.insert(v.begin(), x)
v.pop_front() // v.erase(v.begin())
No comments:
Post a Comment