From 550b4c4e6f2c5f352e7684649fe89e6bdce71377 Mon Sep 17 00:00:00 2001 From: qinmu Date: Wed, 22 May 2024 18:24:00 +0800 Subject: [PATCH] chore: remove redundant line --- en/docs/chapter_hashing/hash_map.md | 1 - 1 file changed, 1 deletion(-) diff --git a/en/docs/chapter_hashing/hash_map.md b/en/docs/chapter_hashing/hash_map.md index 76b402824..934c529d7 100755 --- a/en/docs/chapter_hashing/hash_map.md +++ b/en/docs/chapter_hashing/hash_map.md @@ -526,7 +526,6 @@ As shown in the figure below, both student IDs point to the same name, which is ![Example of hash collision](hash_map.assets/hash_collision.png) - It is easy to understand that as the capacity $n$ of the hash table increases, the probability of multiple keys being assigned to the same bucket decreases, resulting in fewer collisions. Therefore, **we can reduce hash collisions by resizing the hash table**. As shown in the figure below, before resizing, the key-value pairs `(136, A)` and `(236, D)` collide. However, after resizing, the collision is resolved.