lintcode/leetcode由易至难第6题:Number Complement
来源:互联网 发布:8051单片机复位电路 编辑:程序博客网 时间:2024/05/29 16:43
Problems:
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: 5Output: 2Explanation: 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: 1Output: 0Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.Code:
public class Solution { public int findComplement(int num) { return ~mask & (Integer.highestOneBit(num) - 1); }}
阅读全文
0 0
- lintcode/leetcode由易至难第6题:Number Complement
- lintcode/leetcode由易至难第14题:Single Number
- lintcode/leetcode由易至难第22题:Complex Number Multiplication
- 【leetcode】【套路题】476. Number Complement
- LeetCode 476. Number Complement
- leetcode 476. Number Complement
- [leetcode-476]Number Complement
- LeetCode Number Complement
- leetcode-476- Number Complement
- 【Leetcode】476. Number Complement
- 【Leetcode】476. Number Complement
- LeetCode 476. Number Complement
- LEETCODE--Number Complement
- LeetCode 476. Number Complement
- LeetCode--476. Number Complement
- LeetCode 476. Number Complement
- leetcode 476 Number Complement
- 476. Number Complement [LeetCode]
- 浅谈Glide<入门>
- VS2015 Xamarin使用经验4-SQLite ORM
- leetcode461. Hamming Distance
- session和cookie
- 守护进程(精灵进程)
- lintcode/leetcode由易至难第6题:Number Complement
- docker 构建spark集群
- Multi-Programming-8 线程安全类实现生产者和消费者
- 第十三周 动态规划(三)
- 裁切图片
- Tomcat开启8443端口
- Java实现 大顶堆 和 小顶堆
- hive02分区
- springmvc基本原理