Stack.js

function Stack() {
	this.dataStore = [];
	this.top = 0;
	this.push = push;
	this.pop = pop;
	this.peek = peek;
	this.clear = clear;
	this.length = length;
}

function push(element) {
	this.dataStore[this.top++] = element;
}

function pop() {
	return this.dataStore[--this.top];
}

function peek() {
	return this.dataStore[this.top-1];
}

function clear() {
	this.top = 0;
}

function length() {
	return this.top;
}

// 针对2～9进制
function mulBase(num, base) {
	var s = new Stack();
	do {
		s.push(num % base);
		num = Math.floor(num /= base);
	} while (num > 0);
	var converted = '';
	while(s.length() > 0) {
		converted += s.pop();
	}
	return converted;
}

// 判断回文
function isPalindrome(word) {
	var s = new Stack();
	for (var i = 0; i < word.length; i ++) {
		s.push(word[i]);
	}
	var rword = '';
	while(s.length()) {
		rword += s.pop();
	}
	return word === rword;
}