feat: add js solution to lc problem: no.82

Author: lo0b0o

.metals/metals.h2.db

@@ -134,6 +134,47 @@ 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;
+};
+```
+
 ### **...**
 
 ```

.metals/metals.lock.db

@@ -122,6 +122,47 @@ 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;
+};
+```
+
 ### **...**
 
 ```

.metals/metals.log

@@ -0,0 +1,36 @@
+/**
+ * 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;
+};