Skip to content

Commit 291e8cd

Jayden12138 Jayden12138

authored

fix(javascript): merge-k-sorted-lists (labuladong#1575)

1 parent 9968397 commit 291e8cdCopy full SHA for 291e8cd

File tree

1 file changed

+6

-5

lines changed

多语言解法代码
- solution_code.md

1 file changed

+6

-5

lines changed

`‎多语言解法代码/solution_code.md`

Lines changed: 6 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -39379,20 +39379,21 @@ var mergeKLists = function(lists) {`
`39379`	`39379`	`let dummy = new ListNode(-1);`
`39380`	`39380`	`let p = dummy;`
`39381`	`39381`	`// 优先级队列,最小堆`
`39382`		`- let pq = new PriorityQueue(`
`39383`		`- lists.length, (a, b) => (a.val - b.val));`
	`39382`	`+ let pq = new PriorityQueue({`
	`39383`	`+ compare: (a, b) => (a.val - b.val)`
	`39384`	`+ });`
`39384`	`39385`	`// 将 k 个链表的头结点加入最小堆`
`39385`	`39386`	`for (let head of lists) {`
`39386`	`39387`	`if (head != null)`
`39387`		`- pq.add(head);`
	`39388`	`+ pq.enqueue(head);`
`39388`	`39389`	`}`
`39389`	`39390`
`39390`	`39391`	`while (!pq.isEmpty()) {`
`39391`	`39392`	`// 获取最小节点,接到结果链表中`
`39392`		`- let node = pq.poll();`
	`39393`	`+ let node = pq.dequeue();`
`39393`	`39394`	`p.next = node;`
`39394`	`39395`	`if (node.next != null) {`
`39395`		`- pq.add(node.next);`
	`39396`	`+ pq.enqueue(node.next);`
`39396`	`39397`	`}`
`39397`	`39398`	`// p 指针不断前进`
`39398`	`39399`	`p = p.next;`

0 commit comments

Comments

(0)