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

fixed linting issues

Browse Source
This commit is contained in:
Omid Rajabi 2022-02-01 09:39:00 -05:00
parent 21d54e4774
commit f19e6b7a3a
1 changed files with 11 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -2,8 +2,6 @@ import LinkedListNode from './LinkedListNode';
import Comparator from '../../utils/comparator/Comparator'; import Comparator from '../../utils/comparator/Comparator';
export default class LinkedList { export default class LinkedList {
head: any;
tail: any;
/** /**
* @param {Function} [comparatorFunction] * @param {Function} [comparatorFunction]
*/ */
@ -281,20 +279,20 @@ export default class LinkedList {
let node2Prev = null; let node2Prev = null;
let node1 = this.head; let node1 = this.head;
let node2 = this.head; let node2 = this.head;
// elements are same, no swap to be made // elements are same, no swap to be made
if (data1 === data2) { if (data1 === data2) {
return; return;
} }
while (node1 !== null) { while (node1 !== null) {
if (node1.data === data1) { if (node1.data === data1) {
break; break;
} }
node1Prev = node1; node1Prev = node1;
node1 = node1.next; node1 = node1.next;
} }
while (node2 !== null) { while (node2 !== null) {
if (node2.data === data2) { if (node2.data === data2) {
break; break;
@ -302,28 +300,26 @@ export default class LinkedList {
node2Prev = node2; node2Prev = node2;
node2 = node2.next; node2 = node2.next;
} }
// swap not possible, one or more element not in list // swap not possible, one or more element not in list
if (node1 === null || node2 === null) { if (node1 === null || node2 === null) {
return; return;
} }
if (node1Prev === null) { if (node1Prev === null) {
this.head = node2; this.head = node2;
} else { } else {
node1Prev.setNextNode(node2); node1Prev.setNextNode(node2);
} }
if (node2Prev === null) { if (node2Prev === null) {
this.head = node1; this.head = node1;
} else { } else {
node2Prev.setNextNode(node1); node2Prev.setNextNode(node1);
} }
let temp = node1.next; const temp = node1.next;
node1.setNextNode(node2.next); node1.setNextNode(node2.next);
node2.setNextNode(temp); node2.setNextNode(temp);
} }
} }