chapter_data_structure/exercises/

[giscus[bot]]

chapter_data_structure/exercises/

动画图解、一键运行的数据结构与算法教程

https://www.hello-algo.com/chapter_data_structure/exercises/

[xiaoluogende]

n & (n - 1) 会把 n 中最右边的一个 1 变成 0
妙啊

[Dumbliidore]

def count_ones(n: int) -> int:
    count = 0
    while n:
        n &= n - 1   # 清除最低位的 1
        count += 1
    return count

[RockyTL]

def count_ones(n):
    count = 0
    while n:
        n &= n - 1
        count += 1
    return count

[YusukeGodai]

int CountOne(int n) {
    int count = 0;
    for (int i = 0; i < 32; ++i) {
        if (n & 1) {
            count++;
            n = n >> 1;
        }
    }
    return count;
}