Number Complement

最新推荐文章于 2021-10-18 16:19:59 发布

673556617-real

最新推荐文章于 2021-10-18 16:19:59 发布

阅读量236

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/awawfwfw/article/details/77788748

版权

算法同时被 2 个专栏收录

243 篇文章 0 订阅

订阅专栏

leetcode

225 篇文章 0 订阅

订阅专栏

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

因为是easy难度的题，所以没有考虑边界的情况。所以一个遍历然后异或每一位就好。

代码：

        int result = 0;
        int i = 0;
        while(num !=0){
           result += (( num & 1 ) ^ 1) << i++;

           num = num >> 1;
        }
        return result;