绪论
栈的特点:后进先出。
栈的方法:
- push:把一个元素放入栈顶。
- pop:移除栈顶元素。
- peek:返回栈顶元素。
- size:返回栈中元素个数。
正文
<!DOCTYPE html>
<div lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta http-equiv="X-UA-Compatible" content="ie=edge">
<title>index</title>
<script src="js/jquery-2.2.4.min.js"></script>
</head>
<body>
</body>
<script>
$(document).ready(function () {
var stack = new myStack();
stack.push(123);
stack.push('aaaaa');
console.log('长度:' + stack.size());
console.log('栈顶元素:' + stack.peek());
});
function myStack() {
this.count = 0;
this.arr = [];
// 把一个元素放入栈顶
this.push = function (v) {
this.arr[this.count] = v;
this.count++;
};
// 移除栈顶元素
this.pop = function () {
if (this.count === 0) {
return undefined;
}
this.count--;
var result = this.arr[this.count];
delete this.arr[this.count];
return result;
};
// 返回栈顶元素
this.peek = function() {
if (this.count === 0) {
return undefined;
}
return this.arr[this.count - 1];
};
// 返回栈中元素个数
this.size = function() {
return this.count;
};
}
</script>
</div>
结果
(若有什么错误,请留言指正,3Q)