耗时:64ms.
class Solution {
public:
int rangeBitwiseAnd(int m, int n) {
int c1 = 0, c2 = 0;
int i = 0;
while(m&n)
{
if(m == n)
return m<<i;//表示经过中间n-m个值,需要将后面多少位全部换为0.
m = m >> 1;
n = n >> 1;
i++;
}
return 0;
}
}