Commit 7f7e4ea

qiugubyj

and

byj

authored

feat: add linkedList insert method (trekhleb#774)

Co-authored-by: byj <youjia.bi@weimob.com>

1 parent 5b64117 commit 7f7e4eaCopy full SHA for 7f7e4ea

File tree

+49

-0

lines changed

src/data-structures/linked-list
- LinkedList.js
- __test__
  - LinkedList.test.js

+49

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -54,6 +54,40 @@ export default class LinkedList {`
`54`	`54`	`return this;`
`55`	`55`	`}`
`56`	`56`
	`57`	`+ /**`
	`58`	`+ * @param {*} value`
	`59`	`+ * @param {*} index`
	`60`	`+ * @return {LinkedList}`
	`61`	`+ */`
	`62`	`+ insert(value, index) {`
	`63`	`+ index = index < 0 ? 0 : index;`
	`64`	`+ if (index === 0) {`
	`65`	`+ this.prepend(value);`
	`66`	`+ } else {`
	`67`	`+ let count = 1;`
	`68`	`+ let currentNode = this.head;`
	`69`	`+ const newNode = new LinkedListNode(value);`
	`70`	`+ while (currentNode) {`
	`71`	`+ if (count === index) break;`
	`72`	`+ currentNode = currentNode.next;`
	`73`	`+ count++;`
	`74`	`+ }`
	`75`	`+ if (currentNode) {`
	`76`	`+ newNode.next = currentNode.next;`
	`77`	`+ currentNode.next = newNode;`
	`78`	`+ } else {`
	`79`	`+ if (this.tail) {`
	`80`	`+ this.tail.next = newNode;`
	`81`	`+ this.tail = newNode;`
	`82`	`+ } else {`
	`83`	`+ this.head = newNode;`
	`84`	`+ this.tail = newNode;`
	`85`	`+ }`
	`86`	`+ }`
	`87`	`+ }`
	`88`	`+ return this;`
	`89`	`+ }`
	`90`	`+`
`57`	`91`	`/**`
`58`	`92`	`* @param {*} value`
`59`	`93`	`* @return {LinkedListNode}`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -32,6 +32,21 @@ describe('LinkedList', () => {`
`32`	`32`	`expect(linkedList.toString()).toBe('3,2,1');`
`33`	`33`	`});`
`34`	`34`
	`35`	`+ it('should insert node to linked list', () => {`
	`36`	`+ const linkedList = new LinkedList();`
	`37`	`+`
	`38`	`+ linkedList.insert(4, 3);`
	`39`	`+ expect(linkedList.head.toString()).toBe('4');`
	`40`	`+ expect(linkedList.tail.toString()).toBe('4');`
	`41`	`+`
	`42`	`+ linkedList.insert(3, 2);`
	`43`	`+ linkedList.insert(2, 1);`
	`44`	`+ linkedList.insert(1, -7);`
	`45`	`+ linkedList.insert(10, 9);`
	`46`	`+`
	`47`	`+ expect(linkedList.toString()).toBe('1,4,2,3,10');`
	`48`	`+ })`
	`49`	`+`
`35`	`50`	`it('should delete node by value from linked list', () => {`
`36`	`51`	`const linkedList = new LinkedList();`
`37`	`52`

Comments

(0)