leetCode刷题记录59_476_Number Complement

/*****************************************************问题描述*************************************************
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
Note:
The given integer is guaranteed to fit within the range of a 32-bit signed integer.
You could assume no leading zero bit in the integer’s binary representation.
Example 1:
    Input: 5
    Output: 2
    Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Example 2:
    Input: 1
    Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
给定一个正整数，先得到它对应的二进制数，去掉前导的0，然后将二进制的各位取反，返回取反后的数
/*****************************************************我的解答*************************************************
/**
 * @param {number} num
 * @return {number}
 */
var findComplement = function(num) {
    var bNum = num.toString(2);
    var flip = function(number){
        var newStr = "";
        for(var index = 0; index < number.length; index++)
        {
            if(number.charAt(index) === '1')
            {
                newStr += '0';
            }
            else
            {
                newStr += '1';
            }
        }
        for(var start = 0; start < newStr.length; start++)
        {
            if(newStr.charAt(start) !== '0')
            {
                break;
            }    
        }
        newStr = newStr.slice(start);
        return newStr;
    };
    return parseInt(flip(bNum),2);
};