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

adding the period

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-09 16:26:47 -05:00
parent 26ba4a11aa
commit 7e4f88a567
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
lectures/21_hash_tables_II/README.md
View File

@@ -150,7 +150,7 @@ functionality.-->
- Stacks allow access, insertion and deletion from only one end called the top. - Stacks allow access, insertion and deletion from only one end called the top.
- There is no access to values in the middle of a stack. - There is no access to values in the middle of a stack.
- Stacks may be implemented efficiently in terms of vectors and lists, although vectors are preferable. - Stacks may be implemented efficiently in terms of vectors and lists, although vectors are preferable.
- All stack operations are O(1) - All stack operations are O(1).
## 21.7 Additional STL Container Classes: Queues ## 21.7 Additional STL Container Classes: Queues
@@ -158,7 +158,7 @@ functionality.-->
- 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