mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
c909da9b08
* pre-commit: Upgrade psf/black for stable style 2023 Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`. * https://github.com/psf/black/blob/main/CHANGES.md#2310 > This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style… Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit. I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
41 lines
1.0 KiB
Python
41 lines
1.0 KiB
Python
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")
|
|
Traceback (most recent call last):
|
|
...
|
|
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()
|