LeetCode Number Complement

原题链接在这里：https://leetcode.com/problems/number-complement/

题目：

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.

题解：

找到num最左面的1 bit, 从这个位置到最后是要flip的部分. template是从最左位置到最后到时1 bit.

flip原来整体的num, 然后位运算 & template.

Time Complexity: O(1). Space: O(1).

AC Java:

1 public class Solution {
2     public int findComplement(int num) {
3         int template = (Integer.highestOneBit(num) << 1) - 1;
4         num = ~num;
5         return num & template;
6     }
7 }

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/6272363.html

LeetCode Number Complement相关推荐

LeetCode Number of Islands(flood fill)
问题:给出一个由0和1组成的二维网格图(m*n),1表示陆地,0表示水.要求统计有多少块陆地思路:常见的flood fill算法有三种,深度优先搜索.广度优先搜索以及广度扫描法.广度扫描法其实原理与 ...
263.Ugly Number||202 happy number||476 Number Complement||136 Single Number
263.Ugly Number 判断因数是否只有素数2.3.5.. 感觉比较简单: class Solution(object):def isUgly(self, num):""& ...
【LeetCode】476. 数字的补数 Number Complement
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 公众号:负雪明烛本文关键词:Leetcode, 力扣,476, 补数,二进制,Pyth ...
leetcode 476. Number Complement | 476. 数字的补数（位运算）
题目 https://leetcode.com/problems/number-complement/ 题解 class Solution {public int findComplement(int ...
LeetCode之Number Complement
1.题目 Given a positive integer, output its complement number. The complement strategy is to flip the ...
LeetCode 476. Number Complement
题目: Given a positive integer, output its complement number. The complement strategy is to flip the b ...
Leetcode 476. Number Complement 补数解题报告
1 解题思想这道题给了一个正的整数,然后需要计算一个特殊的补数,这个补数的计算方式是: 1.对于这个整数num,转换成对应的二进制表示,这个二进制表示共有x位(不高于32) 2.将这x位取反后,得到 ...
【leetcode】【套路题】476. Number Complement
一.题目描述 Given a positive integer, output its complement number. The complement strategy is to flip th ...
LeetCode算法题-Number Complement（Java实现-五种解法）
这是悦乐书的第240次更新,第253篇原创 01 看题和准备今天介绍的是LeetCode算法题中Easy级别的第107题(顺位题号是476).给定正整数,输出其补码数.补充策略是翻转其二进制表示的位 ...

LeetCode Number Complement

LeetCode Number Complement相关推荐

最新文章

热门文章