In this **Leetcode Number of 1 Bits problem solution**, we need to write a function that takes an unsigned integer and returns the number of '1' bits it has.

## Problem solution in Python.

class Solution: def hammingWeight(self, n): return bin(n).count('1')

## Problem solution in Java.

public class Solution { public int hammingWeight(int n) { int count = 0; for (; n != 0; n &= n-1){ count++; } return count; } }

## Problem solution in C++.

class Solution { public: int hammingWeight(uint32_t n) { int ans=0; while (n) ans += n&1, n=n>>1; return ans; } };

## Problem solution in C.

int hammingWeight(uint32_t n) { int count=0; while(n) { if(n&1) count++; n=n>>1; } return count; }

## 0 Comments