feat(92): 一次遍历

descire · descire · commit b9cc6bd48f11 · 2022-03-15T00:42:54.000+08:00
diff --git a/Linked-List/92/solution2.js b/Linked-List/92/solution2.js
@@ -0,0 +1,25 @@
+/**
+ * 时间复杂度：O(n)
+ * 空间复杂度：O(1)
+ */
+const reverseBetween = (head, m, n) => {
+    const dummyHead = new ListNode(null);
+    dummyHead.next = head;
+
+    let preHead = dummyHead;
+    for (let i = 0; i < m - 1; i++) {
+        preHead = preHead.next;
+    }
+
+    let current = preHead.next;
+    let next = null;
+
+    for (let i = 0; i < n - m; i++) {
+        next = current.next;
+        current.next = next.next;
+        next.next = preHead.next;
+        preHead.next = next;
+    }
+
+    return dummyHead.next;
+}
