Using Bit Masking || Beats 100% || JAVA
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int bitwiseComplement(int n) {\n        if(n==0)\n        return 1;\n        int mask = 0,temp = n;\n        while(n!=0){\n            mask=mask<<1;\n            mask = mask | 1;\n            n=n>>1;\n        }\n        return (~temp) & mask;\n    }\n}\n```
['Java']