mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 13:56:28 +08:00
feat: add code in js
This commit is contained in:
parent
cf628007c8
commit
75fa643113
1 changed files with 28 additions and 0 deletions
28
codes/javascript/chapter_stack_and_queue/stack.js
Normal file
28
codes/javascript/chapter_stack_and_queue/stack.js
Normal file
|
@ -0,0 +1,28 @@
|
||||||
|
/**
|
||||||
|
* File: stack.js
|
||||||
|
* Created Time: 2022-12-04
|
||||||
|
* Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* 初始化栈 */
|
||||||
|
// Javascript 没有内置的栈类,可以把 Array 当作栈来使用
|
||||||
|
const stack = [];
|
||||||
|
|
||||||
|
/* 元素入栈 */
|
||||||
|
stack.push(1);
|
||||||
|
stack.push(3);
|
||||||
|
stack.push(2);
|
||||||
|
stack.push(5);
|
||||||
|
stack.push(4);
|
||||||
|
|
||||||
|
/* 访问栈顶元素 */
|
||||||
|
peek = stack[stack.length - 1];
|
||||||
|
|
||||||
|
/* 元素出栈 */
|
||||||
|
pop = stack.pop();
|
||||||
|
|
||||||
|
/* 获取栈的长度 */
|
||||||
|
size = stack.length;
|
||||||
|
|
||||||
|
/* 判断是否为空 */
|
||||||
|
is_empty = stack.length === 0;
|
Loading…
Reference in a new issue