mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-02-25 18:38:39 +00:00
Add hamming distance (#6194)
* Add hamming distance * Fix doctest * Refactor * Raise ValueError when string lengths are different
This commit is contained in:
parent
e5d1ff2ea8
commit
89fc7bf0b0
39
strings/hamming_distance.py
Normal file
39
strings/hamming_distance.py
Normal file
@ -0,0 +1,39 @@
|
|||||||
|
def hamming_distance(string1: str, string2: str) -> int:
|
||||||
|
"""Calculate the Hamming distance between two equal length strings
|
||||||
|
In information theory, the Hamming distance between two strings of equal
|
||||||
|
length is the number of positions at which the corresponding symbols are
|
||||||
|
different. https://en.wikipedia.org/wiki/Hamming_distance
|
||||||
|
|
||||||
|
Args:
|
||||||
|
string1 (str): Sequence 1
|
||||||
|
string2 (str): Sequence 2
|
||||||
|
|
||||||
|
Returns:
|
||||||
|
int: Hamming distance
|
||||||
|
|
||||||
|
>>> hamming_distance("python", "python")
|
||||||
|
0
|
||||||
|
>>> hamming_distance("karolin", "kathrin")
|
||||||
|
3
|
||||||
|
>>> hamming_distance("00000", "11111")
|
||||||
|
5
|
||||||
|
>>> hamming_distance("karolin", "kath")
|
||||||
|
ValueError: String lengths must match!
|
||||||
|
"""
|
||||||
|
if len(string1) != len(string2):
|
||||||
|
raise ValueError("String lengths must match!")
|
||||||
|
|
||||||
|
count = 0
|
||||||
|
|
||||||
|
for char1, char2 in zip(string1, string2):
|
||||||
|
if char1 != char2:
|
||||||
|
count += 1
|
||||||
|
|
||||||
|
return count
|
||||||
|
|
||||||
|
|
||||||
|
if __name__ == "__main__":
|
||||||
|
|
||||||
|
import doctest
|
||||||
|
|
||||||
|
doctest.testmod()
|
Loading…
x
Reference in New Issue
Block a user