LeetCode——476. Number Complement
来源:互联网 发布:mqttws31.js tcp 连接 编辑:程序博客网 时间:2024/05/13 21:02
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
Note:
The given integer is guaranteed to fit within the range of a 32-bit signed integer.
You could assume no leading zero bit in the integer’s binary representation.
Example 1:
Input: 5
Output: 2
Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Example 2:
Input: 1
Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
public class Solution {public int findComplement(int num) { return (Integer.highestOneBit(num)<<1)-1-num;}
}
!!!英语是真的难!!!
真,真的这个英文题目阅读能力真的是要提高。这个题目意思要的就是反码,complement一查是补码,结果根据题意就是反码 :)反码 = 最大值 - 原码 highestOneBit(num) 是 Integer类的静态方法,返回num的第一个1的位置的二进制代码:比如 num = 5 = 101;那么方法返回就是100; num = 12 = 1100;那么方法返回的就是1000;
阅读全文
0 0
- LeetCode——476. Number Complement
- LeetCode 476. Number Complement
- leetcode 476. Number Complement
- 【Leetcode】476. Number Complement
- 【Leetcode】476. Number Complement
- LeetCode 476. Number Complement
- LeetCode 476. Number Complement
- LeetCode--476. Number Complement
- LeetCode 476. Number Complement
- 476. Number Complement [LeetCode]
- [LeetCode]476.Number Complement
- 【LeetCode】 476. Number Complement
- LeetCode 476. Number Complement
- LeetCode 476. Number Complement
- 【LeetCode】476. Number Complement
- leetcode 476. Number Complement
- [LeetCode]476. Number Complement
- LeetCode 476. Number Complement
- 关于刷新列表向上偏移问题
- 如何实现 H5 后退刷新
- Linux在线库函数查询
- Mybatis Resultmap 简化之超级父类
- 传统围棋高手为何不敌AlphaGo?
- LeetCode——476. Number Complement
- ndk开发
- VS2010动态库调试方法
- VS2015动态库静态加载时指定动态库位置的方法
- 【PostgreSQL-9.6.3】函数(2)--字符型函数
- Android实现双击退出应用
- 怒赞!FACEBOOK内部高效工作PPT指南
- java AES加密解密实例
- Hibernate(一)Hibernate初识