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