LeetCode 476. Number Complement(Java)

本文介绍了一种计算正整数补数的方法。首先确定输入整数的二进制位数,然后利用相同位数的全1二进制数与原数进行异或操作,从而得到补数。

原题:
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.


题意:
给定一个正整数,输出它的补数。补数的策略是通过翻转二进位表示。


思路:
1.求出该数的二进制位数;
2.通过给定数num和相同位数的二进制数(全为1)进行异或,即可求出补数。


代码:

public class Solution {
    public int findComplement(int num) {
        int ans = 0;//the count of the num's bits
        int temp = num;//copy of the num
        while(temp != 0){
            ans++;
            temp /= 2;
        }
        return num ^ (int)(Math.pow(2,ans)-1);
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值