Commit d683f73

committed

Adding queue

1 parent 06fb93c commit d683f73Copy full SHA for d683f73

File tree

+59

-0

lines changed

+59

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+# --- Description`
	`2`	`+`
	`3`	`+Create a queue data structure. The queue`
	`4`	`+should be a class with methods 'add' and 'remove'.`
	`5`	`+Adding to the queue should store an element until`
	`6`	`+it is removed`
	`7`	`+`
	`8`	`+# --- Examples`
	`9`	`+`
	`10`	`+ const q = new Queue();`
	`11`	`+ q.add(1);`
	`12`	`+ q.remove(); should returns 1;`
	`13`	`+`
	`14`	`+`
	`15`	`+# --- Solutions`
	`16`	`+`
	`17`	`+`
	`18`	`+// Solution`
	`19`	`+`
	`20`	`+ class Queue {`
	`21`	`+ constructor(){`
	`22`	`+ this.data = [];`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ add(record){`
	`26`	`+ this.data.unshift(record);`
	`27`	`+ }`
	`28`	`+`
	`29`	`+ remove(){`
	`30`	`+ return this.data.pop();`
	`31`	`+ }`
	`32`	`+ }`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+// --- Description`
	`2`	`+// Create a queue data structure. The queue`
	`3`	`+// should be a class with methods 'add' and 'remove'.`
	`4`	`+// Adding to the queue should store an element until`
	`5`	`+// it is removed`
	`6`	`+`
	`7`	`+// --- Examples`
	`8`	`+// const q = new Queue();`
	`9`	`+// q.add(1);`
	`10`	`+// q.remove(); should returns 1;`
	`11`	`+`
	`12`	`+`
	`13`	`+// Solution`
	`14`	`+`
	`15`	`+class Queue {`
	`16`	`+ constructor(){`
	`17`	`+ this.data = [];`
	`18`	`+ }`
	`19`	`+`
	`20`	`+ add(record){`
	`21`	`+ this.data.unshift(record);`
	`22`	`+ }`
	`23`	`+`
	`24`	`+ remove(){`
	`25`	`+ return this.data.pop();`
	`26`	`+ }`
	`27`	`+}`

Comments

(0)