新的开始

题目链接在此 Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as

啊，又是好久没来了！ 最近又开始刷leetcode，发现题目多了不少。还是从基础开始做吧。 这里是两道关于位运算的题。 1. Hamming Distance 题目链接在此 The Hamming distance between two integers is the number of positions at which the corresponding

原帖在此 WIKI Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Computer programming tasks that require bit manipulation include l

题目链接在此 Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. 要求代码里不能出现 + 和 - 符号，只能用位运算咯。 这位大神把加法、