Leetcode#190. Reverse Bits
ProblemReverse bits of a given 32 bits unsigned integer.
Note:
Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer’s internal binary representation is the same, whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 2 above, the input represents the sig ...
Leetcode#67. Add Binary
ProblemGiven two binary strings a and b, return their sum as a binary string.
Example 1:
123Input: a = "11", b = "1"Output: "100"
Example 2:
123Input: a = "1010", b = "1011"Output: "10101"
Constraints:
1 <= a.length, b.length <= 10^4
a and b consist only of '0' or '1' characters.
Each string does not contain leading zeros except for the zero itself.
Solve123456789101112131415161718192021222324class Solution: ...
Leetcode#201. Bitwise AND of Numbers Range
ProblemGiven two integers left and right that represent the range [left, right], return the bitwise(位元運算) AND of all numbers in this range, inclusive.
Example 1:
123Input: left = 5, right = 7Output: 4
Example 2:
123Input: left = 0, right = 0Output: 0
Example 3:
123Input: left = 1, right = 2147483647Output: 0
Constraints:
0 <= left <= right <= 2^31 - 1
Solve對區間的數字進行位元運算
12345678根據位元的值（0或1）進行邏輯運算位元 AND（&）：對兩個二進制數進行對應位元的 AND 運算。當兩個對應位元都為1時，結果的對應位元為1，否則為0。10101010 (170)& 1100 ...