type SLLNode = {
value: number;
next: SLLNode | null;
};
class SinglyLinkedList {
private head: SLLNode;
private tail: SLLNode;
private length;
constructor(value: number) {
this.head = {
value,
next: null,
};
this.tail = this.head;
this.length = 1;
}
newNode(value): SLLNode {
return {
value,
next: null
}
}
append(value: number) {
const newNode: SLLNode = this.newNode(value);
this.tail.next = newNode;
this.tail = newNode;
this.length++;
return this;
}
prepend(value: number) {
const newNode = this.newNode(value);
newNode.next = this.head;
this.head = newNode;
this.length++;
return this;
}
printList() {
const arr = [];
let currNode = this.head;
while (currNode !== null) {
arr.push(currNode.value);
currNode = currNode.next;
}
console.log('List length: ', this.length);
return arr;
}
insert(index: number, value: number) {
// check params
if (index === 0) {
return this.prepend(value);
}
if (index >= this.length) {
return this.append(value);
}
const preNode = this.traverseToIndex(index - 1);
const aftNode = preNode.next;
let newNode = this.newNode(value);
preNode.next = newNode;
newNode.next = aftNode;
this.length++;
return this;
}
traverseToIndex(index: number) {
let preNode = this.head;
// we need the node before the given index
for (let k = 0; k < index; k++) {
preNode = preNode.next;
}
return preNode;
}
remove(index) {
// check params
const preNode = this.traverseToIndex(index - 1);
const currNode = preNode.next;
const aftNode = currNode.next;
currNode.next = null;
preNode.next = aftNode;
this.length--;
return this;
}
}
// 10 --> 5 --> 16 --> 20
/**
let myLinkedList = {
head: {
value: 10,
next: {
value: 5,
next: {
value: 16,
next: null
}
}
}
}
*/
const myLinkedList = new SinglyLinkedList(10);
myLinkedList.append(5);
myLinkedList.append(16);
myLinkedList.append(20);
myLinkedList.prepend(1);
myLinkedList.insert(1, 3);
myLinkedList.insert(0, 2);
myLinkedList.insert(1, 6);
console.log(myLinkedList.printList());
myLinkedList.remove(2)
console.log(myLinkedList.printList());
