Number of 1 Bits
来源:互联网 发布:上古卷轴5捏脸数据整合 编辑:程序博客网 时间:2024/06/14 23:07
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011
, so the function should return 3.
题目解析:输出一个数字二进制中1的个数
解法解析:有个小技巧而已 n&(n-1)每次都能消灭一个1,比较简单,直接上AC代码
public int hammingWeight(int n) {if(n==0)return 0;int count = 0;while(n!=0){n = n&(n-1);count++;}return count;}
0 0
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- Number of 1 Bits
- [leetcode] Sudoku Solver
- 使用SpannableString设置部分文字大小、颜色、超链接、点击事件
- ubuntu中文手册安装
- POJ_3254_Corn Fields
- osgi2——camel网关调用其它系统webservice
- Number of 1 Bits
- IOS第四节:OC中的内存管理机制
- 详解计算机主机网关的作用
- KMP求循环节问题
- KVC KVO 通知 委托模式 小结
- hbase client访问的超时时间、重试次数、重试间隔时间的配置
- iOS开发核心语言Objective C —— 面向对象思维、setter和getter方法及点语法
- C语言入门笔记20150605
- android学习笔记(8)linearlayout与android:layout_weight学习