算法-栈-十进制转二进制

class Stack {
  items = []
  push = (e) => {
    this.items.push(e)
  }
  pop = () => {
    return this.items.pop()
  }
  peek = () => {
    return this.items[this.items.length - 1]
  }
  isEmpty = () => {
    return this.items.length === 0
  }
  size = () => {
    return this.items.length
  }
  toString = () => {
    return this.items.join('')
  }
}

let stack = new Stack()


//十进制转二进制
test = (x) => {
  const a = x % 2
  stack.push(a)
  const aa = parseInt(x / 2, 10)
  if (aa !== 0) {
    test(aa)
  }
}
test(1000)
console.log('====www===', stack.toString())