Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 461 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 461 # by problem number
lcpy gen -s hamming_distance # by problem name
Input: x = 1, y = 4
Output: 2
Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
↑ ↑
The above arrows point to positions where the corresponding bits are different.
Input: x = 3, y = 1
Output: 1
class Solution:
# Time: O(b), b = number of differing bits (<= 31)
# Space: O(1)
def hamming_distance(self, x: int, y: int) -> int:
return (x ^ y).bit_count()
| Time | Space |
|---|---|
| O(b), b = number of differing bits (<= 31) | O(1) |