From 82fdfc87b7a4edffb14a8adebb13a988bbc0c954 Mon Sep 17 00:00:00 2001
From: Wen <409053122@qq.com>
Date: Wed, 28 Jun 2023 14:46:45 +0800
Subject: [PATCH] =?UTF-8?q?feat:[86]=20=E5=88=86=E9=9A=94=E9=93=BE?=
 =?UTF-8?q?=E8=A1=A8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/leecode/javascript/86.分隔链表.js | 40 +++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 src/leecode/javascript/86.分隔链表.js

diff --git a/src/leecode/javascript/86.分隔链表.js b/src/leecode/javascript/86.分隔链表.js
new file mode 100644
index 0000000..dc624ac
--- /dev/null
+++ b/src/leecode/javascript/86.分隔链表.js
@@ -0,0 +1,40 @@
+/*
+ * @lc app=leetcode.cn id=86 lang=javascript
+ *
+ * [86] 分隔链表
+ */
+
+// @lc code=start
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @param {number} x
+ * @return {ListNode}
+ */
+var partition = function(head, x) {
+  const minHead = new ListNode(0);
+  const maxHead = new ListNode(0);
+  let cur = head;
+  let minCur = minHead;
+  let maxCur = maxHead;
+  while (cur != null) {
+    if (cur.val < x) {
+      minCur.next = new ListNode(cur.val);
+      minCur = minCur.next;
+    } else {
+      maxCur.next = new ListNode(cur.val)
+      maxCur = maxCur.next;
+    }
+    cur = cur.next;
+  }
+  minCur.next = maxHead.next;
+  return minHead.next;
+};
+// @lc code=end
+