LeetCode Number Complement
来源:互联网 发布:mysql insert 编辑:程序博客网 时间:2024/06/15 23:14
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.
#coding=utf-8class Solution(object): #朴素做法 def findComplement(self, num): """ :type num: int :rtype: int """ s = bin(num)[2:] l = len(s) res = [] for i in xrange(l): if s[i] == '0': res.append('1') else: res.append('0') return int("".join(res),2)class Solution2(object): def findComplement(self, num): """ :type num: int :rtype: int """ i = 1 while i<= num: i = i << 1 #now we get i > num return (i-1) ^ num # for example: # 10000 - 1 = 01111
0 0
- 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]
- [LeetCode]476.Number Complement
- LeetCode题解: Number Complement
- 【LeetCode】 476. Number Complement
- LeetCode 476. Number Complement
- 文章标题
- 记住我
- ZCMU—1895
- 540. Single Element in a Sorted Array
- PTA 一 水果忍者
- LeetCode Number Complement
- JAVA文件操作
- Eclipse上安装GIT插件EGit及使用
- jeesite快速开发平台(五)---内置组件的应用
- B
- 并查集- Union-Find
- c#自定义泛型列表
- React Native 热更新实现
- 2017互联网笔试题汇总