Best Java Solution || Beats 100%
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) return 1;\n        int x = 0;\n        int ans = 0;\n\n        while(n>0){\n            int r = n%2;\n            if(r==1){\n                x++;\n            }else{\n                ans = ans + (int)Math.pow(2,x);\n                x++;\n            }\n            n=n/2;\n        }\n        return ans;\n    }\n}\n```
['Java']