476. Number Complement

最新推荐文章于 2018-10-06 20:10:57 发布

zg1g

最新推荐文章于 2018-10-06 20:10:57 发布

阅读量516

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode bit

本文链接：https://blog.csdn.net/daigualu/article/details/72843822

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 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.

代码实现

        public int FindComplement(int num)
        {
            int bits = 1; //num including bits
            while (Math.Pow(2, bits) <= num)
                bits++;
            int sum = (int) Math.Pow(2, bits) - 1;//sum =Pow(2,n)-1: sum of n bits 1
            return  sum - num; //sum - num is the complement
        }