【Leetcode】Number of 1 Bits(easy)

Question

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.

Code

#include<iostream>
using namespace std;class Solution {
public:int hammingWeight(uint32_t n) {int count = 0;while (n != 0) {count++;n = (n - 1)&n;}return count;}
};int main() {Solution so;uint32_t n=11;cout<<so.hammingWeight(n)<<endl;system("pause");return 0;
}

【Leetcode】Number of 1 Bits(easy)相关推荐

【Leetcode】Number of Islands
题目链接:https://leetcode.com/problems/number-of-islands/ 题目: Given a 2d grid map of '1's (land) and '0' ...
【leetcode】length of last word (easy)
题目: 输入字符串 s,返回其最后一个单词的长度如 s="Hello World" 返回5 s="Hello World " 返回5 s=&qu ...
【Leetcode】Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space. 思路:若使用[Leetcode]Reverse I ...
【leetcode】解题日记（未完待续）
开坑,有生之年系列,希望有一天能解出 leetcodeleetcodeleetcode 上的所有题目. 写题解好麻烦,懒得写(手动狗头),进度如下,不定期更新. 总题数已解答题解数 2058 23 ...
【leetcode】486. Predict the Winner
题目如下: Given an array of scores that are non-negative integers. Player 1 picks one of the numbers fro ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...
【LeetCode】《剑指Offer》第Ⅴ篇⊰⊰⊰ 39 - 47题
[LeetCode]<剑指Offer>第Ⅴ篇⊰⊰⊰ 39 - 47题文章目录 [LeetCode]<剑指Offer>第Ⅴ篇⊰⊰⊰ 39 - 47题 39. 数组中出现次数超过 ...
【LeetCode】《剑指Offer》第Ⅰ篇⊰⊰⊰ 3 - 11题
[LeetCode]<剑指Offer>第Ⅰ篇⊰⊰⊰ 3 - 11题文章目录 [LeetCode]<剑指Offer>第Ⅰ篇⊰⊰⊰ 3 - 11题 03. 数组中重复的数字(ea ...
【LeetCode】第374题——猜数字大小（难度：简单）
[LeetCode]第374题--猜数字大小(难度:简单) 题目描述解题思路代码详解注意点题目描述猜数字游戏的规则如下: 每轮游戏,我都会从 1 到 n 随机选择一个数字. 请你猜选出的是哪 ...

【Leetcode】Number of 1 Bits(easy)

Question

Code

【Leetcode】Number of 1 Bits(easy)相关推荐

最新文章

热门文章