476. Number Complement Add to List
来源:互联网 发布:怎么样能在淘宝上开店 编辑:程序博客网 时间:2024/05/20 17:24
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.
Subscribe to see which companies asked this question.
answer:
class Solution {
public:
int findComplement(int num) {
unsigned mask = ~0;
while (num & mask) mask <<= 1;
return ~mask & ~num;
}
};
- 476. Number Complement Add to List
- 414. Third Maximum Number Add to List
- Leetcode-Palindrome Number Add to List
- Add to List 313. Super Ugly Number
- Add to List 447. Number of Boomerangs
- Add to List 611. Valid Triangle Number
- LeetCode 476. Number Complement
- leetcode 476. Number Complement
- 【Leetcode】476. Number Complement
- 【Leetcode】476. Number Complement
- 476. Number Complement*
- LeetCode 476. Number Complement
- LeetCode 476. Number Complement
- LeetCode--476. Number Complement
- LeetCode 476. Number Complement
- 476. Number Complement
- 476. Number Complement [LeetCode]
- 476. Number Complement
- java synchronized 同步机制解析
- slowhttptest的几种慢攻击DOS原理
- 【程序4】输入某年某月某日,判断这一天是这一年的第几天?
- swiper
- Android之与h5交互
- 476. Number Complement Add to List
- 12. Integer to Roman
- 【程序5】输入三个整数x,y,z,请把这三个数由小到大输出
- css属性
- servlet的生命周期
- 动态规划算法问题(经典找零案例)
- 做一个Spring Boot小例子
- LeetCode 345. Reverse Vowels of a String
- Linux学习1