leetcode--Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11’ has binary representation 00000000000000000000000000001011, so the function should return 3

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int i=0,N=32;
        int count1=0;

        for(i;i<N;i++)
        {
            if(1==(n%2)) count1++; 
            n=n>>1;
        }
        return count1;

    }
};