位运算
BlackMan_阿伟
不积跬步无以至千里
展开
-
May——477.汉明距离总和
class Solution: def totalHammingDistance(self, nums: List[int]) -> int: #暴力超时 # res = 0 # for i in range(len(nums)): # for j in range(i+1,len(nums)): # count = bin(nums[i]^nums[j]).count('1') ...原创 2021-05-29 09:58:56 · 159 阅读 · 0 评论 -
《Leetcode of October》268. 缺失数字
class Solution: def missingNumber(self, nums: List[int]) -> int: #暴力法 # nums.sort() # size = len(nums) # for i in range(size): # if i not in nums: # return i # return...原创 2020-10-10 22:08:51 · 128 阅读 · 1 评论 -
位运算:201.数字范围按位与
5 0101 6 0110 7 0111 其实公共前缀就是01 class Solution: def rangeBitwiseAnd(self, m: int, n: int) -> int: shift=0 while m<n: m>>=1 n>>=1 shift+=1 return m<<shift 总结:一...原创 2020-08-23 17:33:53 · 164 阅读 · 0 评论