/**
* Stack 類
*/
class Stack {
 constructor() {
 this.data = []; // 對數(shù)據(jù)初始化
 this.top = 0; // 初始化棧頂位置
 }

 // 入棧方法
 push() {
 const args = [...arguments];
 args.forEach(arg => this.data[this.top++] = arg);
 return this.top;
 }

 // 出棧方法
 pop() {
 if (this.top === 0) throw new Error('The stack is already empty!');
 const peek = this.data[--this.top];
 this.data = this.data.slice(0, -1);
 return peek;
 }

 // 返回棧頂元素
 peek() {
 return this.data[this.top - 1];
 }

 // 返回棧內(nèi)元素個數(shù)
 length() {
 return this.top;
 }

 // 清除棧內(nèi)所有元素
 clear() {
 this.top = 0;
 return this.data = [];
 }

 // 判斷棧是否為空
 isEmpty() {
 return this.top === 0;
 }
}

// 實例化
const stack = new Stack();

stack.push(1);
stack.push(2, 3);
console.log(stack.data); // [1, 2, 3]
console.log(stack.peek()); // 3
console.log(stack.pop()); // 3, now data is [1, 2]
stack.push(3);
console.log(stack.length()); // 3
stack.clear(); // now data is []

/**
 * 將數(shù)字轉(zhuǎn)換為二進制和八進制
 */
const numConvert = (num, base) => {
 const stack = new Stack();
 let converted = '';

 while(num > 0) {
 stack.push(num % base);
 num = Math.floor(num / base);
 }

 while(stack.length() > 0) {
 converted += stack.pop(); 
 }

 return +converted;
}

console.log(numConvert(10, 2)); // 1010

/**
 * 判斷給定字符串或者數(shù)字是否是回文
 */
const isPalindrome = words => {
 const stack = new Stack();
 let wordsCopy = '';
 words = words.toString();

 Array.prototype.forEach.call(words, word => stack.push(word));

 while(stack.length() > 0) {
 wordsCopy += stack.pop();
 }

 return words === wordsCopy;
}

console.log(isPalindrome('1a121a1')); // true
console.log(isPalindrome(2121)); // false