This commit is contained in:
krahets
2023-07-26 15:34:46 +08:00
parent f8f7086196
commit 7351ec70a6
53 changed files with 439 additions and 329 deletions
+2 -2
View File
@@ -71,7 +71,7 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="my_heap.js"
/* 构造方法,建立空堆或根据输入列表建堆 */
@@ -85,7 +85,7 @@ comments: true
}
```
=== "TypeScript"
=== "TS"
```typescript title="my_heap.ts"
/* 构造方法,建立空堆或根据输入列表建堆 */
+10 -10
View File
@@ -240,13 +240,13 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="heap.js"
// JavaScript 未提供内置 Heap 类
```
=== "TypeScript"
=== "TS"
```typescript title="heap.ts"
// TypeScript 未提供内置 Heap 类
@@ -411,7 +411,7 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="my_heap.js"
/* 获取左子节点索引 */
@@ -430,7 +430,7 @@ comments: true
}
```
=== "TypeScript"
=== "TS"
```typescript title="my_heap.ts"
/* 获取左子节点索引 */
@@ -603,7 +603,7 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="my_heap.js"
/* 访问堆顶元素 */
@@ -612,7 +612,7 @@ comments: true
}
```
=== "TypeScript"
=== "TS"
```typescript title="my_heap.ts"
/* 访问堆顶元素 */
@@ -816,7 +816,7 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="my_heap.js"
/* 元素入堆 */
@@ -842,7 +842,7 @@ comments: true
}
```
=== "TypeScript"
=== "TS"
```typescript title="my_heap.ts"
/* 元素入堆 */
@@ -1229,7 +1229,7 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="my_heap.js"
/* 元素出堆 */
@@ -1265,7 +1265,7 @@ comments: true
}
```
=== "TypeScript"
=== "TS"
```typescript title="my_heap.ts"
/* 元素出堆 */
+19 -3
View File
@@ -159,13 +159,13 @@ comments: true
}
```
=== "JavaScript"
=== "JS"
```javascript title="top_k.js"
[class]{}-[func]{topKHeap}
```
=== "TypeScript"
=== "TS"
```typescript title="top_k.ts"
[class]{}-[func]{topKHeap}
@@ -180,7 +180,23 @@ comments: true
=== "C#"
```csharp title="top_k.cs"
[class]{top_k}-[func]{topKHeap}
/* 基于堆查找数组中最大的 k 个元素 */
PriorityQueue<int, int> topKHeap(int[] nums, int k) {
PriorityQueue<int, int> heap = new PriorityQueue<int, int>();
// 将数组的前 k 个元素入堆
for (int i = 0; i < k; i++) {
heap.Enqueue(nums[i], nums[i]);
}
// 从第 k+1 个元素开始,保持堆的长度为 k
for (int i = k; i < nums.Length; i++) {
// 若当前元素大于堆顶元素,则将堆顶元素出堆、当前元素入堆
if (nums[i] > heap.Peek()) {
heap.Dequeue();
heap.Enqueue(nums[i], nums[i]);
}
}
return heap;
}
```
=== "Swift"