Create 0024.js

Barklim · Barklim · commit 4bdcd73a8a6a · 2025-03-11T05:46:00.000+03:00
diff --git a/0024-swap-nodes-in-pairs.js b/0024-swap-nodes-in-pairs.js
@@ -29,3 +29,23 @@ var swapPairs = function(head) {
 
   return result;
 };
+
+// var swapPairs = function(head) {
+//   let dummy = new LinkedListNode()
+//   dummy.next = head
+
+//   current = dummy
+
+//   while (current.next && current.next.next) {
+//       first = current.next
+//       second = current.next.next
+
+//       first.next = second.next
+//       second.next = first
+//       current.next = second
+
+//       current = first
+//   }
+
+//   return dummy.next
+// };
diff --git a/example/3.Linkedlist/0024.js b/example/3.Linkedlist/0024.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 {ListNode}
+ */
+var swapPairs = function(head) {
+
+};
+
+const myLinkedList = new LinkedList();
+myLinkedList.prepend(1);
+myLinkedList.append(2);
+myLinkedList.append(3);
+myLinkedList.append(4);
+
+const myLinkedList2 = new LinkedList();
+
+const myLinkedList3 = new LinkedList();
+myLinkedList3.prepend(1);
+
+const myLinkedList4 = new LinkedList();
+myLinkedList4.prepend(1);
+myLinkedList4.append(2);
+myLinkedList4.append(3);
+
+const myLinkedList5 = new LinkedList();
+myLinkedList5.prepend(1);
+myLinkedList5.append(2);
+myLinkedList5.append(3);
+myLinkedList5.append(4);
+myLinkedList5.append(5);
+myLinkedList5.append(6);
+
+const executeList = (list, n) => swapPairs(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,2,3,5
+execute(myLinkedList2) // [] // []
+execute(myLinkedList3) // [1] // [1]
+execute(myLinkedList4) // 1,2,3 // 2,1,3
+execute(myLinkedList5) // 1,2,3,4,5,6 // 2,1,4,3,6,5
+
+  
diff --git a/example/README.md b/example/README.md
@@ -57,7 +57,7 @@ Better order to solve problems
 234. Palindrome Linked List
 83. Remove Duplicates from Sorted List
 19. Remove Nth Node from End of List
-43. Swap Nodes in Pairs
+24. Swap Nodes in Pairs
 21. Merge Two sorted Lists
 141. Linked List Cycle
 
