693是一道很簡單的題目。

var hasAlternatingBits = function(n) {
    
    var bin = [];
    while(n>0){
        bin.unshift(n%2);
        n = parseInt(n/2);
    }
    
    bin.join(‘‘);
    
    var len = bin.length;
    var i,j;
    
    for(i = 0;i<len ;i++){
        if(bin[i] == bin[i+1]){
            return
 
 false;
        }
    }
    
    return true;
};

leetcode練習：693. Binary Number with Alternating Bits