码迷,mamicode.com
首页 > 其他好文 > 详细

201. Bitwise AND of Numbers Range

时间:2015-04-17 07:05:15      阅读:137      评论:0      收藏:0      [点我收藏+]

标签:

Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

For example, given the range [5, 7], you should return 4.

StackOverflow:http://math.stackexchange.com/questions/1073532/how-to-find-bitwise-and-of-all-numbers-for-a-given-range

寻找最高位m和n都是1的值既是所要的。但是同时所有低位值都要被清零。

public class Solution {
  public int rangeBitwiseAnd(int m, int n) {
    int a = m^n;
    int s = a >> 1;
    while (s != 0) {
      a |= s;
      s >>= 1;
    }
    return m&n&~a;
  }
}

201. Bitwise AND of Numbers Range

标签:

原文地址:http://www.cnblogs.com/shini/p/4433776.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!