Skip to content

Commit fc4b58b

Jayden12138 Jayden12138

authored

[fix][javascript] path-with-maximum-probability (labuladong#1587)

1 parent 1a5d6a4 commit fc4b58bCopy full SHA for fc4b58b

File tree

1 file changed

+7

-25

lines changed

多语言解法代码
- solution_code.md

1 file changed

+7

-25

lines changed

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

Lines changed: 7 additions & 25 deletions

Original file line number	Diff line number	Diff line change
`@@ -49216,14 +49216,16 @@ function dijkstra(start, end, graph) {`
`49216`	`49216`	`distTo[start] = 1;`
`49217`	`49217`
`49218`	`49218`	`// 优先级队列,distFromStart 较小的排在前面`
`49219`		`- const pq = new PriorityQueue((a, b) => {`
`49220`		`- return b.distFromStart - a.distFromStart;`
	`49219`	`+ const pq = new PriorityQueue({`
	`49220`	`+ compare: (a, b) => {`
	`49221`	`+ return b.distFromStart - a.distFromStart;`
	`49222`	`+ }`
`49221`	`49223`	`});`
`49222`	`49224`	`// 从起点 start 开始进行 BFS`
`49223`		`- pq.offer(new State(start, 1));`
	`49225`	`+ pq.enqueue(new State(start, 1));`
`49224`	`49226`
`49225`	`49227`	`while (!pq.isEmpty()) {`
`49226`		`- const curState = pq.poll();`
	`49228`	`+ const curState = pq.dequeue();`
`49227`	`49229`	`const curNodeID = curState.id;`
`49228`	`49230`	`const curDistFromStart = curState.distFromStart;`
`49229`	`49231`
`@@ -49245,32 +49247,12 @@ function dijkstra(start, end, graph) {`
`49245`	`49247`	`// 更新 dp table`
`49246`	`49248`	`distTo[nextNodeID] = distToNextNode;`
`49247`	`49249`	`// 将这个节点以及距离放入队列`
`49248`		`- pq.offer(new State(nextNodeID, distToNextNode));`
	`49250`	`+ pq.enqueue(new State(nextNodeID, distToNextNode));`
`49249`	`49251`	`}`
`49250`	`49252`	`}`
`49251`	`49253`	`}`
`49252`	`49254`	`return 0.0;`
`49253`	`49255`	`}`
`49254`		`-`
`49255`		`-class PriorityQueue {`
`49256`		`- constructor(compare) {`
`49257`		`- this.queue = [];`
`49258`		`- this.compare = compare;`
`49259`		`- }`
`49260`		`-`
`49261`		`- offer(val) {`
`49262`		`- this.queue.push(val);`
`49263`		`- this.queue.sort(this.compare);`
`49264`		`- }`
`49265`		`-`
`49266`		`- poll() {`
`49267`		`- return this.queue.shift();`
`49268`		`- }`
`49269`		`-`
`49270`		`- isEmpty() {`
`49271`		`- return this.queue.length === 0;`
`49272`		`- }`
`49273`		`-}`
`49274`	`49256`	```
`49275`	`49257`
`49276`	`49258`	```python

0 commit comments

Comments

(0)