标签：str integer class inpu strategy int find while bit
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
Note:
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 public class Solution { 2 public int findComplement(int num) { 3 int result = 0; 4 int i = 0; 5 while (num > 0) { 6 int temp = (num & 1) ^ 1; 7 num >>= 1; 8 result += temp << i; 9 i++; 10 } 11 return result; 12 } 13 }
标签：str integer class inpu strategy int find while bit
原文地址：http://www.cnblogs.com/amazingzoe/p/6391351.html
