My code:
public class Solution {
public int rangeBitwiseAnd(int m, int n) {
int i = 1;
while (m != n) {
m >>= 1;
n >>= 1;
i <<= 1;
}
return m * i;
}
}
reference:
一开始看了这个最优解
https://discuss.leetcode.com/topic/12133/bit-operation-solution-java
不明白为什么最后 m * iteration
然后看了这个：
http://www.cnblogs.com/grandyang/p/4431646.html
更加形象，就理解了。
Anyway, Good luck, Richardo! -- 10/14/2016
My code: reference:一开始看了这个最优解 https://discuss.leetcode.co...
Bitwise AND of Numbers Range Happy Number Remove Linked L...
Quite a few problems on Leetcode utilized bitwise operato...
LeetCode 201. Bitwise AND of Numbers Range Description Gi...
题目地址 https://leetcode.com/problems/bitwise-and-of-numbers...
数学方法 02 https://leetcode-cn.com/problems/bitwise-and-of-n...
201. 数字范围按位与[https://leetcode-cn.com/problems/bitwise-and...
LeetCode 306. Additive Number Description Additive number...
leetcode[https://leetcode-cn.com/problems/single-number/]...
leetcode[https://leetcode-cn.com/problems/find-all-number...
本文标题：Leetcode - Bitwise AND of Number
本文链接：https://www.haomeiwen.com/subject/wounyttx.html
网友评论