1 //n & n-1 总是去掉二进制最低位的1 从最高位&起来会快很多 2 class Solution 3 { 4 public: 5 int rangeBitwiseAnd(int m, int n) 6 { 7 //m <= n && m <= n - 1 ——> m <= n - 1 8 while(m <= n - 1) n = n & (n - 1); 9 return n; 10 } 11 };
原文：https://www.cnblogs.com/yuhong1103/p/12631948.html