[Leetcode 191, Easy] Number of 1 Bits
来源:互联网 发布:淘宝的车秒贷怎么样 编辑:程序博客网 时间:2024/05/06 13:24
Problem:
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.
Analysis:
Solution:
C++:
int hammingWeight(uint32_t n) { int num = 0; for(; n > 0; n /= 2) num += (n % 2); return num; }
Java:
Python:
0 0
- [Leetcode 191, Easy] Number of 1 Bits
- 【Leetcode】Number of 1 Bits(easy)
- LeetCode 191. Number of 1 Bits (Easy)
- leetcode 191 Number of 1 Bits(难易度:Easy)
- Easy 191题 Number of 1 Bits
- leetcode:bits:Number of 1 Bits(191)
- Leetcode 191. Number of 1 Bits (Easy) (cpp)
- 【leetcode】191. Number of 1 Bits(easy)
- leetCode #191 number of 1 bits
- LeetCode 191 Number of 1 Bits
- Leetcode NO.191 Number of 1 Bits
- [LeetCode][191][Number of 1 Bits]
- [leetcode 191]Number of 1 Bits
- LeetCode(191) Number of 1 Bits
- LeetCode #191 Number of 1 Bits
- LeetCode 191: Number of 1 Bits
- LeetCode 191 Number of 1 Bits
- Leetcode #191 Number of 1 Bits
- MFC中的文件读写方法总结
- Android-SharedPreferences读写-简单
- Oracle spool 用法小结
- 金蝶EAS消息弹出框样式
- Scrum之 站立例会
- [Leetcode 191, Easy] Number of 1 Bits
- PAT1011A+B和C (15)
- 读懂Java中的Socket编程
- Android深入探究笔记之二 -- 打开一个新的 Activity 并传递参数与如何响应控件的点击事件 .
- 【好习惯】流程图
- Android开发,onCreate()方法介绍
- Scrum之 评审会议
- Android Tombstone/Crash的log分析和定位
- PowerDesigner设计实体类图解