首页 > 学院 > 开发设计 > 正文

LeetCode题解: Number Complement

2019-11-14 10:02:56
字体:
来源:转载
供稿:网友

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: 5Output: 2Explanation: 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: 1Output: 0Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.

思路:

数清leading zeros,翻转位,然后清掉不需要的位。

题解:

int findComplement(int num) {    int zeros(0);    for(; zeros < 32; ++zeros) {        if (num & (1 << 31)) {            break;        }        num <<= 1;    }    num = ~num;    for(; zeros > 0; --zeros) {        num >>= 1;    }    return num;}


发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表