fix: fix names and move content to correct place

This commit is contained in:
S-N-O-R-L-A-X 2022-12-10 00:00:07 +08:00
parent 7ce5ae1608
commit 15120d307a
2 changed files with 83 additions and 82 deletions

View File

@ -1,5 +1,5 @@
/** /**
* File: array_stack.ts * File: array_stack.js
* Created Time: 2022-12-09 * Created Time: 2022-12-09
* Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com) * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
*/ */

View File

@ -397,92 +397,13 @@ comments: true
=== "JavaScript" === "JavaScript"
```js title="linkedlist_stack.js" ```js title="linkedlist_stack.js"
/* 基于数组实现的栈 */
class ArrayStack {
stack;
constructor() {
this.stack = [];
}
/* 获取栈的长度 */
get size() {
return this.stack.length;
}
/* 判断栈是否为空 */
empty() {
return this.stack.length === 0;
}
/* 入栈 */
push(num) {
this.stack.push(num);
}
/* 出栈 */
pop() {
return this.stack.pop();
}
/* 访问栈顶元素 */
top() {
return this.stack[this.stack.length - 1];
}
/* 访问索引 index 处元素 */
get(index) {
return this.stack[index];
}
/* 返回 Array */
toArray() {
return this.stack;
}
};
``` ```
=== "TypeScript" === "TypeScript"
```typescript title="linkedlist_stack.ts" ```typescript title="linkedlist_stack.ts"
class ArrayStack {
private stack: number[];
constructor() {
this.stack = [];
}
/* 获取栈的长度 */
get size(): number {
return this.stack.length;
}
/* 判断栈是否为空 */
empty(): boolean {
return this.stack.length === 0;
}
/* 入栈 */
push(num: number): void {
this.stack.push(num);
}
/* 出栈 */
pop(): number | undefined {
return this.stack.pop();
}
/* 访问栈顶元素 */
top(): number | undefined {
return this.stack[this.stack.length - 1];
}
/* 访问索引 index 处元素 */
get(index: number): number | undefined {
return this.stack[index];
}
/* 返回 Array */
toArray() {
return this.stack;
}
};
``` ```
=== "C" === "C"
@ -666,13 +587,93 @@ comments: true
=== "JavaScript" === "JavaScript"
```js title="array_stack.js" ```js title="array_stack.js"
/* 基于数组实现的栈 */
class ArrayStack {
stack;
constructor() {
this.stack = [];
}
/* 获取栈的长度 */
get size() {
return this.stack.length;
}
/* 判断栈是否为空 */
empty() {
return this.stack.length === 0;
}
/* 入栈 */
push(num) {
this.stack.push(num);
}
/* 出栈 */
pop() {
return this.stack.pop();
}
/* 访问栈顶元素 */
top() {
return this.stack[this.stack.length - 1];
}
/* 访问索引 index 处元素 */
get(index) {
return this.stack[index];
}
/* 返回 Array */
toArray() {
return this.stack;
}
};
``` ```
=== "TypeScript" === "TypeScript"
```typescript title="array_stack.ts" ```typescript title="array_stack.ts"
/* 基于数组实现的栈 */
class ArrayStack {
private stack: number[];
constructor() {
this.stack = [];
}
/* 获取栈的长度 */
get size(): number {
return this.stack.length;
}
/* 判断栈是否为空 */
empty(): boolean {
return this.stack.length === 0;
}
/* 入栈 */
push(num: number): void {
this.stack.push(num);
}
/* 出栈 */
pop(): number | undefined {
return this.stack.pop();
}
/* 访问栈顶元素 */
top(): number | undefined {
return this.stack[this.stack.length - 1];
}
/* 访问索引 index 处元素 */
get(index: number): number | undefined {
return this.stack[index];
}
/* 返回 Array */
toArray() {
return this.stack;
}
};
``` ```
=== "C" === "C"