leetCode之旅(14)-Number of 1 Bits
来源:互联网 发布:大数据安全保密制度 编辑:程序博客网 时间:2024/06/11 08:17
题目描述:
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Subscribe to see which companies asked this question ##
思路分析:
给定一个无符号整数。求整它转化为二进制以后,里面的1的个数
代码:
public class Solution {
// you need to treat n as an unsigned valuepublic int hammingWeight(int n) { //用来计数 int count = 0; for(int i = 0;i < 32;i++){ if((n&1) != 0){ count++; } n = n>>1; } return count;}
} ##
0 0
- leetCode之旅(14)-Number of 1 Bits
- LeetCode题库之Number of 1 Bits
- leetcode之Number of 1 Bits
- leetcode之number of 1 bits
- leetcode之Number of 1 Bits
- leetcode之Number of 1 Bits,Reverse Bits,Rotate Array
- LeetCode(191)Number of 1 Bits
- leetcode:bits:Number of 1 Bits(191)
- LeetCode:Number of 1 Bits
- LeetCode-Number of 1 Bits
- leetcode: Number of 1 Bits
- LeetCode Number of 1 Bits
- Leetcode: Number of 1 Bits
- Leetcode--Number of 1 Bits
- [LeetCode] Number of 1 Bits
- [leetcode]Number of 1 Bits
- Leetcode-Number of 1 Bits
- LeetCode Number of 1 Bits
- linux中没有dos2UNIX或者UNIX2dos命令怎么解决
- Unknown column 'xxx' in 'field list'
- Must Know Tips/Tricks in Deep Neural Networks
- BOZJ 4444([Scoi2015]国旗计划-区间问题)
- 第4周项目5-用递归方法求解(2)
- leetCode之旅(14)-Number of 1 Bits
- 链表的冒泡排序
- Java compiler level does not match
- HTML5+开发移动app教程
- 关于排序
- 云数据库 OceanBase邀测初体验
- courier-authlib报错你急不急?
- ffmpeg 架构分析
- solaris10 编译安装nginx1.9,作TCP端口转发