1 class Solution 2 { 3 public: 4 int findComplement(int num) 5 { 6 int res = 0,t = 0; 7 while(num) 8 { 9 res += !(num & 1) << t; 10 num >>= 1,t ++; 11 } 12 return res; 13 } 14 };
476. 数字的补数
原文：https://www.cnblogs.com/yuhong1103/p/12718722.html
