191. Number of 1 Bits

最新推荐文章于 2024-01-19 11:12:51 发布

原创最新推荐文章于 2024-01-19 11:12:51 发布 · 83 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Bit Manipulation

刷题笔记专栏收录该内容

304 篇文章

订阅专栏

本文介绍了一种使用位运算来计算一个整数在二进制表示中有多少个1的方法。通过不断将数字与其减一后的结果进行按位与运算，可以有效地消除最后一位的1，直到该数字变为0。

1、题目描述

输入一个数字，返回它的二进制表示中有多少个1.

2、思路

位运算，删除一个数字的最后一个1的方法是 n&(n-1)，

重复这个运算，直至n为0.

3、代码

    int hammingWeight(uint32_t n) {
        int ans = 0;
        while(n){
            n=n&(n-1);
            ans++;
        }
        return ans;
    }

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

zibingling777

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

C# LeetCode刷题 - Leetcode 191. Number of 1 Bits-题解

极客学长Bravo | 突破信息差 | 副业生财有术

06-09

431

C#版 - Leetcode 191. Number of 1 Bits题解 191. 位1的个数在线提交: https://leetcode-cn.com/problems/number-of-1-bits/description/ 题目描述编写一个函数，输入是一个无符号整数，返回其二进制表达式中数字位数为 ‘1’ 的个数（也被称为汉明重量）。示例 : 输入: 1...

[LeetCode]--191. Number of 1 Bits

杜鲁门的博客

10-09

731

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 0000000000000

参与评论您还未登录，请先登录后发表或查看评论

191. Number of 1 Bits*

珍妮的选择的博客

03-27

355

191. Number of 1 Bits* https://leetcode.com/problems/number-of-1-bits/ 题目描述 Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the Hamming weight)....

[leetcode]191. Number of 1 Bits

weixin_32135877的博客

06-08

235

[leetcode]191. Number of 1 Bits Analysis 周五啦~—— [高考结束了耶~] Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight). 比较简单，...

[leetcode BY python]191. Number of 1 Bits

sharonITlion的博客

04-11

405

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 000000000000...

191.Number of 1 Bits

HWHuangeian的博客

10-08

419

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 000000

191. Number of 1 Bits | Java最短代码实现

hdtopku

04-03

636

原题链接：191. Number of 1 Bits 【思路】运用位运算中的一个技巧n &= (n - 1)可以将最右边的一个1置0后返回给n // you need to treat n as an unsigned value public int hammingWeight(int n) { int res = 0; while (n

Leetcode 191. Number of 1 Bits

小白菜又菜

09-05

986

【代码】Leetcode 191. Number of 1 Bits。

Leetcode 191. Number of 1 Bits (Python)

weixin_58080442的博客

04-12

507

Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as theHamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a s.

LeetCode --- 191. Number of 1 Bits

MissXy_的博客

05-15

448

191. Number of 1 Bits Difficulty: Easy Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the ). Example 1: Input: 00000000000000000000000000001011...

191. Number of 1 Bits Leetcode Python

hyperbolechi的专栏

03-16

1555

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 00000000

LeetCode C++ 191. Number of 1 Bits【位运算】简单

memcpy0的博客

10-02

461

Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the Hamming weight). Example 1: Input: 00000000000000000000000000001011 Output: 3 Explanation: The input binary string 00000000000000000000000000001011

191. Number of 1 Bits [easy] (Python)

Coder_Orz的博客

05-05

3861

题目链接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

【LeetCode 面试经典150题】191. Number of 1 Bits 1比特的数量

qq_43513394的博客

01-19

397

编写一个函数，接受一个无符号整数的二进制表示，并返回它具有的 ‘1’ 比特的数量（也称为汉明重量）。通过位操作检查整数中每一位是否为 ‘1’。对于整数的每一位，使用位掩码来检查该位是否为 ‘1’。如果这个函数被多次调用，你会如何优化它？

奥运会科普平台系统-奥运会科普平台系统源码-奥运会科普平台系统代码-springboot奥运会科普平台系统源码-基于springboot的奥运会科普平台系统设计与实现-项目代码