hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

modified insert method in linked list and .eslintrc

Browse Source
This commit is contained in:
unknown 2023-07-21 21:10:42 +05:30
parent 8c5e5f4f0d
commit 4cd4bb9ba9
2 changed files with 31 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
.eslintrc
View File

@ -5,12 +5,14 @@
"env": {
"jest/globals": true
},
"ignorePatterns": ["*.md", "*.png", "*.jpeg", "*.jpg"],
"rules": {
"no-bitwise": "off",
"no-lonely-if": "off",
"class-methods-use-this": "off",
"arrow-body-style": "off",
"no-loop-func": "off"
"no-loop-func": "off",
"linebreak-style": ["error", "windows"]
},
"settings": {
"react": {

49
src/data-structures/linked-list/LinkedList.js
View File

@ -63,27 +63,32 @@ export default class LinkedList {
const index = rawIndex < 0 ? 0 : rawIndex;
if (index === 0) {
this.prepend(value);
return this;
}
// if we have single node in linked list and we have to insert a value we can insert at last
if (this.head === this.tail) {
this.append(value);
return this;
}
const newNode = new LinkedListNode(value);
let count = 1;
let currentNode = this.head;
while (currentNode) {
if (count === index) break;
currentNode = currentNode.next;
count += 1;
}
// if there is a node in the position we want to insert
if (currentNode) {
newNode.next = currentNode.next;
currentNode.next = newNode;
} else {
let count = 1;
let currentNode = this.head;
const newNode = new LinkedListNode(value);
while (currentNode) {
if (count === index) break;
currentNode = currentNode.next;
count += 1;
}
if (currentNode) {
newNode.next = currentNode.next;
currentNode.next = newNode;
} else {
if (this.tail) {
this.tail.next = newNode;
this.tail = newNode;
} else {
this.head = newNode;
this.tail = newNode;
}
}
/* if index exceeds the size of linked list we
will be appending the node at last or if the linked
list dosent exist we will be appending the value that
means inserting a new value into the linked list */
this.append(value);
}
return this;
}
@ -239,7 +244,9 @@ export default class LinkedList {
* @return {string}
*/
toString(callback) {
return this.toArray().map((node) => node.toString(callback)).toString();
return this.toArray()
.map((node) => node.toString(callback))
.toString();
}
/**