leetcode

commit 984b046289e42a44c930f59d2ec755239b08a440
parent 60c856d9e0dab13b2d8d71e0c9b1b16ca3b45338
Author: AndrewLockVI <andrewlaack1@gmail.com>
Date:   Tue, 25 Apr 2023 11:45:25 -0500

Completed swap nodes problem

Diffstat:
A
swap-nodes/swap-nodes.js
 | 
35
+++++++++++++++++++++++++++++++++++

1 file changed, 35 insertions(+), 0 deletions(-)
diff --git a/swap-nodes/swap-nodes.js b/swap-nodes/swap-nodes.js
@@ -0,0 +1,35 @@
+//Swap nodes that are next to each other. Ex.
+//[x1 , y1 , x2 , y3] -> [y1 , x1 , y2, x2]
+//This solution has a time compexity of O(n) where n
+//is the length of the linked list.
+
+
+/**
+ * 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) {
+    if(head == null){
+        return head;
+    }
+    if(head.next == null){
+        return head;
+    }  
+    let itr1 = head;
+    let itr2 = head?.next;
+    while(itr2 != null){
+        let temp = itr1.val;
+        itr1.val = itr2.val;
+        itr2.val = temp;
+        itr1 = itr2?.next;
+        itr2 = itr1?.next;
+    }
+    return head;
+};