• View
• Edit
• History
• Print

20130902b

Hamming-távolság

The Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other.

Examples:

The words at the positions in bold are different, thus their Hamming distance is 3.

Write a function that calculates the Hamming distance of two strings.

Special case

The Hamming distance is defined on two strings of equal length. How would you treat that case when the strings' lengths are different?