Time: 0 ms (100.00%), Space: 5.9 MB (30.84%) - LeetHub

Author: anand-3399

1009-complement-of-base-10-integer/1009-complement-of-base-10-integer.cpp

@@ -3,18 +3,13 @@ class Solution {
     int bitwiseComplement(int n) {
 
         int m = n;
-        int mask = 0;
+        int mask = 0; 
+        if(n == 0) return 1;
 
-        // Exception case
-        if (n == 0)
-            return 1;
-        
-        while(m!=0)
-        {
+        while(m != 0){
             mask = (mask << 1) | 1;
             m = m >> 1;
         }
-        
         int ans = (~n) & mask;
         return ans;
     }