数据结构（js版 笔记）

数据结构（js版）和 jQuery正在一起学。想要一起学的小伙伴加我哦 

Stack
先进后出

1. push()    进栈
2. pop()    出栈
3. isEmpty()   栈空？
4. clear()   清理栈
5. peek()  返回栈顶
6. size()   然后栈的长度

 

 

栈的创建

function Stack() {
    var item = [];
    this.push = function(e) {
        item.push(e);
    };
    this.pop = function() {
        return item.pop();
    };
    this.isEmpty = function() {
        return (item.length == 0) ? true : false;
    };
    this.size = function() {
        return item.length;
    };
    this.clear = function() {
        item = [];
    };
    this.peek= function() {
        return item[item.length - 1];
    };
    this.print = function() {
        console.log(item.toString());
    };
}

 2,8 16进制转换

function Stack() {
    var item = [];
    this.push = function(e) {
        item.push(e);
    };
    this.pop = function() {
        return item.pop();
    };
    this.isEmpty = function() {
        return (item.length == 0) ? true : false;
    };
    this.size = function() {
        return item.length;
    };
    this.clear = function() {
        item = [];
    };
    this.peek= function() {
        return item[item.length - 1];
    };
    this.print = function() {
        console.log(item.toString());
    };
}
// 进制转换
function change(number , n) {
    var stack = new Stack();
    var str = '0123456789abcdef';
    while(number > 0) {
        var remain = number % n;
        stack.push(str[remain]);
        number = Math.floor(number / n);
    }
    while(!stack.isEmpty()) {
        console.log(stack.pop());
    }
}
change(28 , 16);