lintcode/leetcode由易至难第6题:Number Complement
2017-06-06 22:50
344 查看
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:
Example 2:
Code:
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.
Code:
public class Solution { public int findComplement(int num) { return ~mask & (Integer.highestOneBit(num) - 1); } }
相关文章推荐
- LintCode,hihoCoder,LeetCode有什么区别?
- lintcode/leetcode由易至难第12题:Majority Element
- lintcode/leetcode由易至难第13题:Max Consecutive Ones
- [LintCode/LeetCode]——两数和、三数和、四数和
- lintcode/leetcode由易至难第20题:Integer Break
- lintcode/leetcode由易至难第9题:Nim Game
- 排颜色问题——数组 leetcode lintcode
- lintcode/leetcode由易至难第8题:Reverse String
- lintcode/leetcode由易至难第2题:冒泡排序
- Climping Stairs lintcode/leetcode
- lintcode/leetcode由易至难第17题:Counting Bits
- lintcode/leetcode由易至难第3题:选择排序
- lintcode/leetcode由易至难第15题:Merge Two Binary Trees
- lintcode/leetcode由易至难第19题:Teemo Attacking
- lintcode/leetcode由易至难第22题:Complex Number Multiplication
- lintcode/leetcode由易至难第5题:Hamming Distance
- lintcode/leetcode由易至难第14题:Single Number
- lintcode/leetcode由易至难第4题:Array Partition I
- 排颜色问题——数组 leetcode lintcode
- lintcode/leetcode由易至难第10题:Delete Node in a Linked List