add linked lists

Barklim · Barklim · commit 058d082405f0 · 2025-03-13T10:33:05.000+03:00
diff --git a/0002-add-two-numbers.js b/0002-add-two-numbers.js
@@ -36,3 +36,25 @@ var addTwoNumbers = function(l1, l2) {
 
   return result.next;
 };
+
+// var addTwoNumbers = function(l1, l2) {
+//   const dummy = new LinkedListNode();
+//   let cur = dummy;
+
+//   let carry = 0;
+//   while (l1 || l2 || carry) {
+//       const v1 = l1 ? l1.val : 0;
+//       const v2 = l2 ? l2.val : 0;
+
+//       let val = v1 + v2 + carry;
+//       carry = Math.floor(val / 10);
+//       val = val % 10;
+//       cur.next = new LinkedListNode(val);
+
+//       cur = cur.next;
+//       l1 = l1 ? l1.next : null;
+//       l2 = l2 ? l2.next : null;
+//   }
+
+//   return dummy.next;
+// };
diff --git a/0143-reorder-list.js b/0143-reorder-list.js
@@ -55,3 +55,27 @@ var reorderList = function(head) {
     list2 = center1.next;
   }
 };
+
+// var reorderList = function(head) {
+//   if (!head) return;
+
+//   const nodes = [];
+//   let cur = head;
+//   while (cur) {
+//       nodes.push(cur);
+//       cur = cur.next;
+//   }
+
+//   let i = 0, j = nodes.length - 1;
+//   while (i < j) {
+//       nodes[i].next = nodes[j];
+//       i++;
+//       if (i >= j) break;
+//       nodes[j].next = nodes[i];
+//       j--;
+//   }
+
+//   nodes[i].next = null;
+
+//   return head
+// };
diff --git a/example/3.Linkedlist/0002.js b/example/3.Linkedlist/0002.js
@@ -0,0 +1,79 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} l1
+ * @param {ListNode} l2
+ * @return {ListNode}
+ */
+var addTwoNumbers = function(l1, l2) {
+
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(2);
+myLinkedList.append(4);
+myLinkedList.append(3);
+
+const myLinkedList2 = new LinkedList();
+myLinkedList2.prepend(5);
+myLinkedList2.append(6);
+myLinkedList2.append(4);
+
+const myLinkedList3 = new LinkedList();
+myLinkedList3.prepend(0);
+
+const myLinkedList4 = new LinkedList();
+myLinkedList4.prepend(0);
+
+const myLinkedList5 = new LinkedList();
+myLinkedList5.prepend(9);
+myLinkedList5.append(9);
+myLinkedList5.append(9);
+myLinkedList5.append(9);
+myLinkedList5.append(9);
+myLinkedList5.append(9);
+myLinkedList5.append(9);
+
+const myLinkedList6 = new LinkedList();
+myLinkedList6.prepend(9);
+myLinkedList6.append(9);
+myLinkedList6.append(9);
+myLinkedList6.append(9);
+
+const myLinkedList7 = new LinkedList();
+myLinkedList7.prepend(1);
+myLinkedList7.append(2);
+myLinkedList7.append(3);
+
+const myLinkedList8 = new LinkedList();
+myLinkedList8.prepend(4);
+myLinkedList8.append(5);
+myLinkedList8.append(6);
+
+const myLinkedList9 = new LinkedList();
+myLinkedList3.prepend(9);
+
+const myLinkedList10 = new LinkedList();
+myLinkedList4.prepend(9);
+
+
+const executeList = (l1, l2) => addTwoNumbers(l1.head, l2.head)
+
+const execute = (l1, l2) => {
+    console.log('travers')
+    console.log(l1.toString());
+    console.log(l2.toString());
+    const list1 = executeList(l1, l2)
+    console.log(traversList(list1))
+}
+
+execute(myLinkedList, myLinkedList2) // [2,4,3] [5,6,4] // [7,0,8]
+execute(myLinkedList3, myLinkedList4) // [0] [0] // [0] ???
+execute(myLinkedList5, myLinkedList6) // [9,9,9,9,9,9,9] [9,9,9,9] // [8,9,9,9,0,0,0,1]
+execute(myLinkedList7, myLinkedList8) // [1,2,3] [4,5,6] // [5,7,9]
+execute(myLinkedList9, myLinkedList10) // [9] [9] // [8,1]
diff --git a/example/3.Linkedlist/0138.js b/example/3.Linkedlist/0138.js
@@ -0,0 +1,66 @@
+/**
+ * // Definition for a _Node.
+ * function _Node(val, next, random) {
+ *    this.val = val;
+ *    this.next = next;
+ *    this.random = random;
+ * };
+ */
+
+/**
+ * @param {_Node} head
+ * @return {_Node}
+ */
+var copyRandomList = function(head) {
+    map = new Map();
+
+    if (head === null) return null;
+    if (map.has(head)) return map.get(head);
+    
+    const copy = new LinkedListNode(head.val);
+    map.set(head, copy);
+    copy.next = copyRandomList(head.next);
+    copy.random = map.get(head.random) || null;
+    return copy;
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(1);
+myLinkedList.append(2);
+myLinkedList.append(3);
+myLinkedList.append(4);
+
+const myLinkedList2 = new LinkedList();
+myLinkedList2.prepend(1);
+myLinkedList2.append(2);
+myLinkedList2.append(3);
+myLinkedList2.append(4);
+myLinkedList2.append(5);
+
+const myLinkedList3 = new LinkedList();
+myLinkedList3.prepend(2);
+myLinkedList3.append(4);
+myLinkedList3.append(6);
+myLinkedList3.append(8);
+
+const myLinkedList4 = new LinkedList();
+myLinkedList4.prepend(2);
+myLinkedList4.append(4);
+myLinkedList4.append(6);
+myLinkedList4.append(8);
+myLinkedList4.append(10);
+
+
+const executeList = list => copyRandomList(list.head)
+
+const execute = list => {
+    console.log('travers')
+    console.log(list.toString());
+    const list1 = executeList(list)
+    console.log(traversList(list1))
+}
+
+execute(myLinkedList) // [1,2,3,4] // [1,4,2,3]
+execute(myLinkedList2) // [1,2,3,4,5] // [1,5,2,4,3]
+execute(myLinkedList3) // [2,4,6,8] // [2,8,4,6]
+execute(myLinkedList4) // [2,4,6,8,10] // [2,10,4,8,6]
diff --git a/example/3.Linkedlist/0141.js b/example/3.Linkedlist/0141.js
@@ -0,0 +1,15 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+
+/**
+ * @param {ListNode} head
+ * @return {boolean}
+ */
+var hasCycle = function(head) {
+
+};
diff --git a/example/3.Linkedlist/0143.js b/example/3.Linkedlist/0143.js
@@ -0,0 +1,55 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {void} Do not return anything, modify head in-place instead.
+ */
+var reorderList = function(head) {
+
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(1);
+myLinkedList.append(2);
+myLinkedList.append(3);
+myLinkedList.append(4);
+
+const myLinkedList2 = new LinkedList();
+myLinkedList2.prepend(1);
+myLinkedList2.append(2);
+myLinkedList2.append(3);
+myLinkedList2.append(4);
+myLinkedList2.append(5);
+
+const myLinkedList3 = new LinkedList();
+myLinkedList3.prepend(2);
+myLinkedList3.append(4);
+myLinkedList3.append(6);
+myLinkedList3.append(8);
+
+const myLinkedList4 = new LinkedList();
+myLinkedList4.prepend(2);
+myLinkedList4.append(4);
+myLinkedList4.append(6);
+myLinkedList4.append(8);
+myLinkedList4.append(10);
+
+
+const executeList = list => reorderList(list.head)
+
+const execute = list => {
+    console.log('travers')
+    console.log(list.toString());
+    const list1 = executeList(list)
+    console.log(traversList(list1))
+}
+
+execute(myLinkedList) // [1,2,3,4] // [1,4,2,3]
+execute(myLinkedList2) // [1,2,3,4,5] // [1,5,2,4,3]
+execute(myLinkedList3) // [2,4,6,8] // [2,8,4,6]
+execute(myLinkedList4) // [2,4,6,8,10] // [2,10,4,8,6]
diff --git a/example/3.Linkedlist/0287.js b/example/3.Linkedlist/0287.js
@@ -0,0 +1,57 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findDuplicate = function(nums) {
+
+};
+
+// const myLinkedList = new LinkedList();
+// myLinkedList.prepend(1);
+// myLinkedList.append(3);
+// myLinkedList.append(4);
+// myLinkedList.append(2);
+// myLinkedList.append(2);
+
+// const myLinkedList2 = new LinkedList();
+// myLinkedList2.prepend(3);
+// myLinkedList2.append(1);
+// myLinkedList2.append(3);
+// myLinkedList2.append(4);
+// myLinkedList2.append(2);
+
+// const myLinkedList3 = new LinkedList();
+// myLinkedList3.prepend(3);
+// myLinkedList3.append(3);
+// myLinkedList3.append(3);
+// myLinkedList3.append(3);
+// myLinkedList3.append(3);
+
+// const myLinkedList4 = new LinkedList();
+// myLinkedList4.prepend(1);
+// myLinkedList4.append(2);
+// myLinkedList4.append(3);
+// myLinkedList4.append(2);
+// myLinkedList4.append(2);
+
+// const myLinkedList5 = new LinkedList();
+// myLinkedList5.prepend(1);
+// myLinkedList5.append(2);
+// myLinkedList5.append(3);
+// myLinkedList5.append(4);
+// myLinkedList5.append(4);
+
+// const executeList = list => reorderList(list.head)
+
+// const execute = list => {
+//     console.log('travers')
+//     console.log(list.toString());
+//     const list1 = executeList(list)
+//     console.log(traversList(list1))
+// }
+
+// execute(myLinkedList) // [1,3,4,2,2] // 2
+// execute(myLinkedList2) // [3,1,3,4,2] // 3
+// execute(myLinkedList3) // [3,3,3,3,3] // 3
+// execute(myLinkedList4) // [1,2,3,2,2] // 2
+// execute(myLinkedList5) // [1,2,3,4,4] // 4
diff --git a/example/README.md b/example/README.md
@@ -42,13 +42,12 @@ Better order to solve problems
 904. Fruit Into Baskets
 0. 
 121. Best Time to Buy and Sell Stock
-424. Longest Repeating Character Replacement
 - 424. Longest Repeating Character Replacement
 - 567. Permutation in String
 - 76. Minimum Window Substring
 - 239. Sliding Window Maximum
 
-### Linked list
+### [Linked list](https://github.com/Barklim/leetcode-javascript/tree/master/example/3.Linkedlist)
 
 707. Design Linked List
 876. Middle of the Linked List
@@ -60,6 +59,13 @@ Better order to solve problems
 24. Swap Nodes in Pairs
 21. Merge Two sorted Lists
 141. Linked List Cycle
+0. 
+143. Reorder List
+- 138. Copy List with Random Pointer
+- 2. Add Two Numbers
+- 287. Find the Duplicate Number
+- 23. Merge k Sorted Lists
+- 25. Reverse Nodes in k-Group
 
 ### HashMap
 
