From 083a5c029461182e48ec18c653204235003f78e9 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 13 Nov 2023 22:25:38 -0500 Subject: [PATCH] adding period --- lectures/21_hash_tables_II/README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/lectures/21_hash_tables_II/README.md b/lectures/21_hash_tables_II/README.md index e0da275..05ff41b 100644 --- a/lectures/21_hash_tables_II/README.md +++ b/lectures/21_hash_tables_II/README.md @@ -154,10 +154,9 @@ functionality.--> ## 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. - - Queues may be implemented efficiently in terms of a list. Using vectors for queues is also possible, -but requires more work to get right. + - 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). ## 21.8 Leetcode Exercises