Implement `hammingWeight(n)` returning the number of set bits (1s) in the binary representation of the non-negative integer `n`.
+ 1 hidden test run on Submit.
Inspecting bits one at a time counts ones in O(number of bits) time.
Run your code to see results.