The trick is to Get mask, mine without calling highestbit


  • 0
    G
    public class Solution {
        public int findComplement(int num) {
            int bit = (int)Math.ceil(Math.log(num)/Math.log(2));
            int mask = (1 << bit) - 1;
            return ~num & mask;
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.