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.
class Solution {public: int findComplement(int num) { vector<int>vec; for(int i=0;i<32;++i) { vec.push_back(0); } int st = 0; while(num) { vec[st++] = (num%2); num/=2; } int k = 31; while(vec[k--]==0); for(int j=k+1;j>=0;--j) { if(vec[j]==0) vec[j] = 1; else vec[j] = 0; } int res = 0; for(int i = 0;i<32;++i) { if(vec[i]==0) continue; else res += vec[i]*pow(2,i); } return res; }};新聞熱點
疑難解答
