algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Use abbreviation for JavaScript and TypeScript

Browse Source
This commit is contained in:
krahets
2023-07-26 15:35:38 +08:00
parent 85d12360ed
commit b9b324b298
52 changed files with 310 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
docs/chapter_tree/array_representation_of_tree.md
View File

@@ -54,7 +54,7 @@
tree := []any{1, 2, 3, 4, nil, 6, 7, 8, 9, nil, nil, 12, nil, nil, 15}
```
=== "JavaScript"
=== "JS"
```javascript title=""
/* 二叉树的数组表示 */
@@ -62,7 +62,7 @@
let tree = [1, 2, 3, 4, null, 6, 7, 8, 9, null, null, 12, null, null, 15];
```
=== "TypeScript"
=== "TS"
```typescript title=""
/* 二叉树的数组表示 */
@@ -149,13 +149,13 @@
[class]{arrayBinaryTree}-[func]{}
```
=== "JavaScript"
=== "JS"
```javascript title="array_binary_tree.js"
[class]{ArrayBinaryTree}-[func]{}
```
=== "TypeScript"
=== "TS"
```typescript title="array_binary_tree.ts"
[class]{ArrayBinaryTree}-[func]{}

32
docs/chapter_tree/avl_tree.md
View File

@@ -71,7 +71,7 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
}
```
=== "JavaScript"
=== "JS"
```javascript title=""
/* AVL 树节点类 */
@@ -89,7 +89,7 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
}
```
=== "TypeScript"
=== "TS"
```typescript title=""
/* AVL 树节点类 */
@@ -222,7 +222,7 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
[class]{aVLTree}-[func]{updateHeight}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{height}
@@ -230,7 +230,7 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
[class]{AVLTree}-[func]{#updateHeight}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{height}
@@ -314,13 +314,13 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
[class]{aVLTree}-[func]{balanceFactor}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{balanceFactor}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{balanceFactor}
@@ -418,13 +418,13 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{aVLTree}-[func]{rightRotate}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{#rightRotate}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{rightRotate}
@@ -502,13 +502,13 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{aVLTree}-[func]{leftRotate}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{#leftRotate}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{leftRotate}
@@ -607,13 +607,13 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{aVLTree}-[func]{rotate}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{#rotate}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{rotate}
@@ -693,7 +693,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{aVLTree}-[func]{insertHelper}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{insert}
@@ -701,7 +701,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{AVLTree}-[func]{#insertHelper}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{insert}
@@ -793,7 +793,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{aVLTree}-[func]{removeHelper}
```
=== "JavaScript"
=== "JS"
```javascript title="avl_tree.js"
[class]{AVLTree}-[func]{remove}
@@ -801,7 +801,7 @@ AVL 树的特点在于「旋转 Rotation」操作，它能够在不影响二叉
[class]{AVLTree}-[func]{#removeHelper}
```
=== "TypeScript"
=== "TS"
```typescript title="avl_tree.ts"
[class]{AVLTree}-[func]{remove}

12
docs/chapter_tree/binary_search_tree.md
View File

@@ -55,13 +55,13 @@
[class]{binarySearchTree}-[func]{search}
```
=== "JavaScript"
=== "JS"
```javascript title="binary_search_tree.js"
[class]{}-[func]{search}
```
=== "TypeScript"
=== "TS"
```typescript title="binary_search_tree.ts"
[class]{}-[func]{search}
@@ -138,13 +138,13 @@
[class]{binarySearchTree}-[func]{insert}
```
=== "JavaScript"
=== "JS"
```javascript title="binary_search_tree.js"
[class]{}-[func]{insert}
```
=== "TypeScript"
=== "TS"
```typescript title="binary_search_tree.ts"
[class]{}-[func]{insert}
@@ -245,13 +245,13 @@
[class]{binarySearchTree}-[func]{remove}
```
=== "JavaScript"
=== "JS"
```javascript title="binary_search_tree.js"
[class]{}-[func]{remove}
```
=== "TypeScript"
=== "TS"
```typescript title="binary_search_tree.ts"
[class]{}-[func]{remove}

12
docs/chapter_tree/binary_tree.md
View File

@@ -56,7 +56,7 @@
}
```
=== "JavaScript"
=== "JS"
```javascript title=""
/* 二叉树节点类 */
@@ -67,7 +67,7 @@
}
```
=== "TypeScript"
=== "TS"
```typescript title=""
/* 二叉树节点类 */
@@ -257,7 +257,7 @@
n2.Right = n5
```
=== "JavaScript"
=== "JS"
```javascript title="binary_tree.js"
/* 初始化二叉树 */
@@ -274,7 +274,7 @@
n2.right = n5;
```
=== "TypeScript"
=== "TS"
```typescript title="binary_tree.ts"
/* 初始化二叉树 */
@@ -421,7 +421,7 @@
n1.Left = n2
```
=== "JavaScript"
=== "JS"
```javascript title="binary_tree.js"
/* 插入与删除节点 */
@@ -433,7 +433,7 @@
n1.left = n2;
```
=== "TypeScript"
=== "TS"
```typescript title="binary_tree.ts"
/* 插入与删除节点 */

8
docs/chapter_tree/binary_tree_traversal.md
View File

@@ -38,13 +38,13 @@
[class]{}-[func]{levelOrder}
```
=== "JavaScript"
=== "JS"
```javascript title="binary_tree_bfs.js"
[class]{}-[func]{levelOrder}
```
=== "TypeScript"
=== "TS"
```typescript title="binary_tree_bfs.ts"
[class]{}-[func]{levelOrder}
@@ -140,7 +140,7 @@
[class]{}-[func]{postOrder}
```
=== "JavaScript"
=== "JS"
```javascript title="binary_tree_dfs.js"
[class]{}-[func]{preOrder}
@@ -150,7 +150,7 @@
[class]{}-[func]{postOrder}
```
=== "TypeScript"
=== "TS"
```typescript title="binary_tree_dfs.ts"
[class]{}-[func]{preOrder}