Commit 05e3133

committed

修改封装的队列结构代码

1 parent 03b5120 commit 05e3133Copy full SHA for 05e3133

File tree

+15

-9

lines changed

+15

-9

lines changed

Lines changed: 10 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,31 +1,36 @@`
`1`	`1`	`import Queue from './queue';`
`2`	`2`	`import passGame from './passGame';`
`3`	`3`
`4`		`-// ----- 队列结构测试 -----//`
	`4`	`+// ---------------- 封装的队列结构测试 ---------------- //`
`5`	`5`	`console.log('// ----- 队列结构测试 START -----//');`
`6`	`6`	`const queue = new Queue();`
`7`	`7`
`8`		`-// 入队操作`
	`8`	`+// enqueue() 测试`
`9`	`9`	`queue.enqueue('a');`
`10`	`10`	`queue.enqueue('b');`
`11`	`11`	`queue.enqueue('c');`
`12`	`12`	`queue.enqueue('d');`
`13`	`13`	`console.log(queue.items); //--> ["a", "b", "c", "d"]`
`14`	`14`
`15`		`-// 出队操作(先进先出)`
	`15`	`+// dequeue() 测试`
`16`	`16`	`queue.dequeue();`
`17`	`17`	`queue.dequeue();`
`18`	`18`	`console.log(queue.items); //--> ["c", "d"]`
`19`	`19`
`20`		`-// 查看队头的元素`
	`20`	`+// front() 测试`
`21`	`21`	`console.log(queue.front()); //--> c`
`22`	`22`
	`23`	`+// isEmpty() 测试`
`23`	`24`	`console.log(queue.isEmpty()); //--> false`
	`25`	`+`
	`26`	`+// size() 测试`
`24`	`27`	`console.log(queue.size()); //--> 2`
	`28`	`+`
	`29`	`+// toString() 测试`
`25`	`30`	`console.log(queue.toString()); //--> c d`
`26`	`31`
`27`	`32`
`28`		`-// 击鼓传花方法的测试`
	`33`	`+// passGame() 测试`
`29`	`34`	`const names = ['lily', 'lucy', 'tom', 'tony', 'jack'];`
`30`	`35`	`const targetIndex = passGame(names, 4);`
`31`	`36`	`console.log('击鼓传花', names[targetIndex]); //--> lily`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`import Queue from './queue.js';`
`2`	`2`
`3`		`-// 击鼓传花游戏求解方法的封装`
	`3`	`+// 利用队列结构的特点实现击鼓传花游戏求解方法的封装`
`4`	`4`	`export default function passGame(nameList, number) {`
`5`	`5`	`// 1、new 一个 Queue 对象`
`6`	`6`	`const queue = new Queue();`

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,17 +5,17 @@ export default class Queue {`
`5`	`5`	`this.items = [];`
`6`	`6`	`}`
`7`	`7`
`8`		`- // enqueue() 入队,将元素加入到队列中`
	`8`	`+ // enqueue(item) 入队,将元素加入到队列中`
`9`	`9`	`enqueue(item) {`
`10`	`10`	`this.items.push(item);`
`11`	`11`	`}`
`12`	`12`
`13`		`- // dequeue() 出队,从队列中删除前端元素,返回删除的元素`
	`13`	`+ // dequeue() 出队,从队列中删除队头元素,返回删除的那个元素`
`14`	`14`	`dequeue() {`
`15`	`15`	`return this.items.shift();`
`16`	`16`	`}`
`17`	`17`
`18`		`- // front() 查看队列的前端元素`
	`18`	`+ // front() 查看队列的队头元素`
`19`	`19`	`front() {`
`20`	`20`	`return this.items[0];`
`21`	`21`	`}`
`@@ -30,6 +30,7 @@ export default class Queue {`
`30`	`30`	`return this.items.length;`
`31`	`31`	`}`
`32`	`32`
	`33`	`+ // toString() 将队列中的元素以字符串形式返回`
`33`	`34`	`toString() {`
`34`	`35`	`let result = '';`
`35`	`36`	`for (let item of this.items) {`

Comments

(0)