反向位leetcode问题解决方案不通过所有测试

Question

这就是问题，这是我的解决方案，但没有被接受。我做错了什么？

/**
 * @param {number} n - a positive integer
 * @return {number} - a positive integer
 */
var reverseBits = function(n) {
    let arrOne = [];
    let arrTwo = [];
    let num = 0;
    arrOne = n.toString(2).split("");
    let m = 0;
    for (let i = arrOne.length - 1; i >= 0; i--) {
        arrTwo.push(arrOne[i]);
    }
    console.log(arrTwo);
    for (let k = arrTwo.length - 1; k >= 0; k--) {
        if (arrTwo[k] == 1) {
            num += (2**m);
        }
        m++;
    }
    return num;
};

Answer 1

你可以做到...
看看

/**
 * @param {number} n - a positive integer
 * @return {number} - a positive integer
 */
const reverseBits = n =>
  {
  let bin = 1
    , res = 0
    ;
  for (let x of n.toString(2))
    {
    if (+x) res |= bin // or if (x==='1')  res += bin 
    bin <<= 1          // binary shift left
    }
  return res
  }

let val = 243
  , res = reverseBits(val)
  ;
console.log( val, val.toString(2), '--> ', res, res.toString(2) )

.as-console-wrapper { max-height: 100% !important; top: 0; }
.as-console-row::after { display: none !important; }