⌨️
LeetCode-python
  • 066. Plus One
  • 002. Add Two Numbers
  • 011. Container With Most Water
  • 045. Jump Game II
  • 055. Jump Game
  • 062. Unique Paths
  • 67. Add Binary
  • 068. Text Justification
  • 069. Sqrt(x)
  • 075. Sort Colors
  • 104. Maximum Depth of Binary Tree
  • 118. Pascal's Triangle
  • 182. Duplicate Emails
  • 191. Number of 1 Bits
  • 202. Happy Number
  • 211. Add and Search Word - Data structure design
  • 238. Product of Array Except Self
  • 258. Add Digits
  • 322. Coin Change
  • 461. Hamming Distance
  • 535. Encode and Decode TinyURL
  • 595. Big Countries
  • 647. Palindromic Substrings
  • 654. Maximum Binary Tree
  • 657. Robot Return to Origin
  • 665. Non-decreasing Array
  • 690. Employee Importance
  • 701. Insert into a Binary Search Tree
  • 704. Binary Search
  • 709. To Lower Case
  • 771. Jewels and Stones
  • 804. Unique Morse Code Words
  • 806. Number of Lines To Write String
  • 807. Max Increase to Keep City Skyline
  • 832. Flipping an Image
  • 849. Maximize Distance to Closest Person
  • 905. Sort Array By Parity
  • 921. Minimum Add to Make Parentheses Valid
  • 929. Unique Email Addresses
  • 938. Range Sum of BST
  • 961. N-Repeated Element in Size 2N Array
  • 977. Squares of a Sorted Array
  • 1021. Remove Outermost Parentheses
  • 1038. Binary Search Tree to Greater Sum Tree
Powered by GitBook
On this page
  • Question 191
  • Answer

191. Number of 1 Bits

Previous182. Duplicate EmailsNext202. Happy Number

Last updated 6 years ago

Question 191

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

Example 1:

Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011

Answer 

class Solution(object):
    def hammingWeight(self, n):
        AnswerINT = 0
        while(n):
            if(n%2):
                AnswerINT += 1
            n = n // 2
        return AnswerINT

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