在 JavaScript 中使用最小和最大堆管理流数据：数字运动员健康技术视角

class minheap {

constructor() {

this.heap = [];

}

getmin() {

return this.heap[0];

}

insert(value) {

this.heap.push(value);

this.bubbleup();

}

bubbleup() {

let index =搭建项目系统点我wcqh.cn this.heap.length – 1;

while (index > 0) {

let parentindex = math.floor((index – 1) / 2);

if (this.heap[parentindex]

<h4>

使用最小堆计算运动员恢复时间

</h4>

<p>现在，让我们将其应用到我们的场景中：<br></p>

<pre class=”brush:php;toolbar:false”>const recoverytimes = new minheap();

recoverytimes.insert(10); // athlete a

recoverytimes.insert(搭建项目系统点我wcqh.cn7);  // athlete b

recoverytimes.insert(12); // athlete c

console.log(“fastest recovery time:”, recoverytimes.getmin()); // outputs: 7

登录后复制

class maxheap {

constructor() {

this.heap = [];

}

getmax() {

return this.heap[0];

}

insert(value) {

this.heap.push(value);

this.bubbleup();

}

bubbleup() {

let index = this.heap.length – 1;

while (index &gt搭建项目系统点我wcqh.cn; 0) {

let parentindex = math.floor((index – 1) / 2);

if (this.heap[parentindex] &gt;= this.heap[index]) break;

[this.heap[parentindex], this.heap[index]] = [this.heap[index], this.heap[parentindex]];

index = parentindex;

}

}

extractmax() {

if (this.heap.length === 1) return this.heap.pop();

const max = this搭建项目系统点我wcqh.cn.heap[0];

this.heap[0] = this.heap.pop();

this.bubbledown();

return max;

}

bubbledown() {

let index = 0;

const length = this.heap.length;

const element = this.heap[0];

while (true) {

let leftchildindex = 2 * index + 1;

let rightchildindex = 2 * index + 2;

let leftchild, rightchild;

let swap = null;

if (leftchildi搭建项目系统点我wcqh.cnndex  element) swap = leftchildindex;

}

if (rightchildindex  element) ||

(swap !== null &amp;&amp; rightchild &gt; leftchild)

) {

swap = rightchildindex;

}

}

if (swap === null) break;

[this.heap[index], this.heap[swap]] = [this.heap[swap], this.heap[index]];

index = swap;

}

}

}

登录后复制

const heartrates = new maxheap();

heartrates.insert(150); // athlete a

heartrates.insert(165); // athlete b

heartrates.insert(160); // athlete c

console.log(“peak heart rate:”, heartrates.getmax()); // outputs: 165

登录后复制

import heapq

# create an empty list to represent the heap

re搭建项目系统点我wcqh.cncovery_times = []

# add elements to the heap

heapq.heappush(recovery_times, 10)  # athlete a

heapq.heappush(recovery_times, 7)   # athlete b

heapq.heappush(recovery_times, 12)  # athlete c

fastest_recovery_time = heapq.heappop(recovery_times)

print(f”搭建项目系统点我wcqh.cnfastest recovery time: {fastest_recovery_time}”)  # outputs: 7

登录后复制

// First, you would need to install the @datastructures-js/priority-queue library using npm:

// npm install @datastructures-js/priorit搭建项目系统点我wcqh.cny-queue

const { MinPriorityQueue } = require(@datastructures-js/priority-queue);

// Create a new min heap

const minHeap = new MinPriorityQueue();

// Add elements to the heap

minHeap.enqueue(10); // Athlete A

minHeap.enqueue(7);  // Athlete B

minHeap.enqueue(12); // Athlete C

搭建项目系统点我wcqh.cn

const fastestRecoveryTime = minHeap.dequeue().element;

console.log(“Fastest recovery time:”, fastestRecoveryTime); // Outputs: 7

登录后复制