Commit 82c54b5

committed

更新优先队列的封装

1 parent b052392 commit 82c54b5Copy full SHA for 82c54b5

File tree

+16

-14

lines changed

+16

-14

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import PriorityQueue from './priorityQueue';`
	`1`	`+import {PriorityQueue} from './priorityQueue';`
`2`	`2`
`3`	`3`	`// ----- 优先队列结构测试 -----//`
`4`	`4`	`console.log('// ----- 优先队列结构测试 START -----//');`

Lines changed: 15 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,24 +1,26 @@`
`1`		`-// 优先队列结构的封装`
`2`		`-export default class PriorityQueue {`
	`1`	`+/**`
	`2`	`+ * 优先队列结构的封装`
	`3`	`+ */`
`3`	`4`
`4`		`- constructor() {`
`5`		`-`
`6`		`- this.items = [];`
	`5`	`+// 优先队列内部的元素类`
	`6`	`+class QueueElement {`
	`7`	`+ constructor(element, priority) {`
	`8`	`+ this.element = element;`
	`9`	`+ this.priority = priority;`
	`10`	`+ }`
	`11`	`+}`
`7`	`12`
`8`		`- // 内部类`
`9`		`- this.QueueElement = class {`
`10`		`- constructor(element, priority) {`
`11`		`- this.element = element;`
`12`		`- this.priority = priority;`
`13`		`- }`
`14`		`- };`
	`13`	`+// 优先队列类`
	`14`	`+export class PriorityQueue {`
`15`	`15`
	`16`	`+ constructor() {`
	`17`	`+ this.items = [];`
`16`	`18`	`}`
`17`	`19`
`18`	`20`	`// enqueue() 入队,将元素按优先级加入到队列中`
`19`	`21`	`enqueue(element, priority) {`
`20`	`22`	`// 根据传入的元素,创建 QueueElement 对象`
`21`		`- const queueElement = new this.QueueElement(element, priority);`
	`23`	`+ const queueElement = new QueueElement(element, priority);`
`22`	`24`
`23`	`25`	`// 判断队列是否为空`
`24`	`26`	`if (this.isEmpty()) {`

Comments

(0)