关闭

LeetCode-Number of 1 Bits-解题报告

标签: C++leetcode
215人阅读 评论(0) 收藏 举报
分类:

原题链接 https://leetcode.com/problems/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.


饭后一个数中位1的个数。


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


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:15497次
    • 积分:850
    • 等级:
    • 排名:千里之外
    • 原创:72篇
    • 转载:6篇
    • 译文:0篇
    • 评论:0条
    文章分类