feat: add js solution to leetcode problem: no.86

Author: lo0b0o

.metals/metals.h2.db

@@ -0,0 +1,6 @@
+#FileLock
+#Fri Aug 13 21:54:54 CST 2021
+server=localhost\:64970
+hostName=localhost
+method=file
+id=17b3f994b58bce93b6bb4619a065c552a932c9d6848

.metals/metals.lock.db

@@ -0,0 +1,4 @@
+2021.08.13 21:00:13 INFO  Started: Metals version 0.10.5 in workspace 'D:\github\multi-lc\leetcode' for client Visual Studio Code 1.59.0.
+2021.08.13 21:00:15 INFO  time: initialize in 1.7s
+2021.08.13 21:00:15 WARN  Build server is not auto-connectable.
+2021.08.13 21:00:15 WARN  no build tool detected in workspace 'D:\github\multi-lc\leetcode'. The most common cause for this problem is that the editor was opened in the wrong working directory, for example if you use sbt then the workspace directory should contain build.sbt. 

.metals/metals.log

@@ -144,6 +144,48 @@ public:
     }
 };
 ```
+### **JavaScript**
+
+```js
+/**
+ * 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 deleteDuplicates = function (head) {
+    let cur = head;
+    let pre = new ListNode(0);
+    pre.next = head;
+    let dummy = pre;
+    let rep = false;
+    if (!head || !head.next) {
+        return head;
+    }
+    while (cur) {
+        while (cur.next && cur.val == cur.next.val) {
+            cur = cur.next;
+            rep = true;
+        }
+        if (rep) {
+            pre.next = cur.next;
+            cur = cur.next;
+        } else {
+            pre = cur;
+            cur = cur.next;
+        }
+        rep = false;
+    }
+    return dummy.next;
+};
+```
+
+
 
 ### **...**
 

solution/0000-0099/0086.Partition List/README.md

@@ -132,6 +132,44 @@ public:
     }
 };
 ```
+### **JavaScript**
+
+```js
+/**
+ * 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) {
+
+    if (!head || !head.next) {
+        return head;
+    }
+    const dummy1 = new ListNode(-1), dummy2 = new ListNode(-1);
+    let cur1 = dummy1, cur2 = dummy2;
+    let cur = head;
+    while (cur) {
+        if (cur.val < x) {
+            cur1.next = cur;
+            cur1 = cur1.next;
+        } else {
+            cur2.next = cur;
+            cur2 = cur2.next;
+        }
+        cur = cur.next;
+    }
+    cur2.next = null;
+    cur1.next = dummy2.next;
+    return (dummy1.next);
+};
+```
 
 ### **...**
 

solution/0000-0099/0086.Partition List/README_EN.md

@@ -0,0 +1,34 @@
+/**
+ * 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) {
+
+    if (!head || !head.next) {
+        return head;
+    }
+    const dummy1 = new ListNode(-1), dummy2 = new ListNode(-1);
+    let cur1 = dummy1, cur2 = dummy2;
+    let cur = head;
+    while (cur) {
+        if (cur.val < x) {
+            cur1.next = cur;
+            cur1 = cur1.next;
+        } else {
+            cur2.next = cur;
+            cur2 = cur2.next;
+        }
+        cur = cur.next;
+    }
+    cur2.next = null;
+    cur1.next = dummy2.next;
+    return (dummy1.next);
+};