Time: 3 ms (41.07%), Space: 7.6 MB (33.08%) - LeetHub

Author: knockcat

0476-number-complement/0476-number-complement.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int findComplement(int num) {
+        
+        int ans = 0;
+        bool ok = false;
+        
+        for(int i = 31; i >= 0; --i)
+        {
+            if(!(num & (1 << i)) and ok)
+            {
+                ans += (1 << i);
+            }
+            
+            if(num & (1 << i))
+            {
+                ok = true;
+            }
+        }
+        
+        return ans;
+    }
+};