Create 0021.js

Author: Barklim

0021-merge-two-sorted-lists.js

@@ -33,3 +33,31 @@ var mergeTwoLists = function(l1, l2) {
 
   return l1;
 };
+
+// var mergeTwoLists = function(list1, list2) {
+//   const dummy = new LinkedListNode();
+//   current = dummy
+
+//   p1 = list1
+//   p2 = list2
+
+//   while (p1 && p2) {
+//       if (p1.val < p2.val) {
+//           current.next = p1
+//           p1 = p1.next
+//       } else {
+//           current.next = p2
+//           p2 = p2.next
+//       }
+
+//       current = current.next
+//   }
+
+//   if (p1) {
+//       current.next = p1
+//   } else {
+//       current.next = p2
+//   }
+
+//   return dummy.next
+// };

example/3.Linkedlist/0021.js

@@ -0,0 +1,50 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} list1
+ * @param {ListNode} list2
+ * @return {ListNode}
+ */
+var mergeTwoLists = function(list1, list2) {
+
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(1);
+myLinkedList.append(2);
+myLinkedList.append(4);
+
+const myLinkedList2 = new LinkedList();
+myLinkedList2.prepend(1);
+myLinkedList2.append(3);
+myLinkedList2.append(4);
+
+const myLinkedList3 = new LinkedList();
+
+const myLinkedList4 = new LinkedList();
+
+const myLinkedList5 = new LinkedList();
+
+const myLinkedList6 = new LinkedList();
+myLinkedList6.prepend(0);
+
+const executeList = (list, list2) => mergeTwoLists(list.head, list2.head)
+
+const execute = (list, list2) => {
+    console.log('travers')
+    console.log(list.toString());
+    console.log(list2.toString());
+    const list1 = executeList(list, list2)
+    console.log(traversList(list1))
+}
+
+execute(myLinkedList, myLinkedList2) // 1,2,4 1,3,4 // 1,1,2,3,4,4
+execute(myLinkedList3, myLinkedList4) // [] [] // []
+execute(myLinkedList5, myLinkedList6) // [] [0] // [0]
+
+