leetcode191

public class Solution {
    public int HammingWeight(uint n) {
        var list = new List<uint>();

            do
            {
                var x = n % 2;
                list.Add(x);
                n = n / 2;
            } while (n != 0);

            var count = 0;

            for (int i = 0; i < list.Count; i++)
            {
                if (list[i] == 1)
                {
                    count++;
                }
            }

            return count;
    }
}

https://leetcode.com/problems/number-of-1-bits/#/description

补充一个python的实现：

class Solution:
    def hammingWeight(self, n: int) -> int:
        ret = 0
        while n != 0:
            cur = n % 2
            if cur == 1:
                ret += 1
            n = n // 2
        return ret