From 7e4f88a567fd97a670f9cc0e09b5ebca47a58889 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Thu, 9 Nov 2023 16:26:47 -0500 Subject: [PATCH] adding the period --- lectures/21_hash_tables_II/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/lectures/21_hash_tables_II/README.md b/lectures/21_hash_tables_II/README.md index da45f60..3ae7239 100644 --- a/lectures/21_hash_tables_II/README.md +++ b/lectures/21_hash_tables_II/README.md @@ -150,7 +150,7 @@ functionality.--> - 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. - 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 @@ -158,7 +158,7 @@ functionality.--> - 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, but requires more work to get right. - - All queue operations are O(1) + - All queue operations are O(1). ## 21.8 Leetcode Exercises