Open guodongxiaren opened 4 years ago
int power_of_2(int n) { return !((n-1) & n); }
int count_digit(long n) { return floor(log10(n)) + 1; }
int hammingWeight(uint32_t n) { int num = 0; while (n) { n &= (n-1); num++; } return num; }
判断数字是否是2的幂