JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding period

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-13 22:25:38 -05:00
parent 008d4b5a61
commit 083a5c0294
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
lectures/21_hash_tables_II/README.md
View File

@@ -154,10 +154,9 @@ functionality.-->
## 21.7 Additional STL Container Classes: Queues ## 21.7 Additional STL Container Classes: Queues
- Queues allow insertion at one end, called the back and removal from the other end, called the front - Queues allow insertion at one end, called the back and removal from the other end, called the front.
- There is no access to values in the middle of a queue. - There is no access to values in the middle of a queue.
- Queues may be implemented efficiently in terms of a list. Using vectors for queues is also possible, - Queues may be implemented efficiently in terms of a list. Using vectors for queues is also possible, but requires more work to get right.
but requires more work to get right.
- All queue operations are O(1). - All queue operations are O(1).
## 21.8 Leetcode Exercises ## 21.8 Leetcode Exercises