feat: add javascript solution to lcci problem: No.02.03.Delete Middle Node (doocs#368)

* feat: add javascript solution to lcci problem: No.02.01.Remove Duplicate Node

* feat: add javascript solution to lcci problem: No.02.02.Kth Node From End of List

* feat: add javascript solution to lcci problem: No.02.03.Delete Middle Node

Author: zhaocchen

lcci/02.03.Delete Middle Node/README.md

@@ -66,6 +66,26 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} node
+ * @return {void} Do not return anything, modify node in-place instead.
+ */
+ var deleteNode = function(node) {
+    node.val = node.next.val
+    node.next = node.next.next
+};
+```
+
 ### **...**
 
 ```

lcci/02.03.Delete Middle Node/README_EN.md

@@ -60,6 +60,26 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} node
+ * @return {void} Do not return anything, modify node in-place instead.
+ */
+ var deleteNode = function(node) {
+    node.val = node.next.val
+    node.next = node.next.next
+};
+```
+
 ### **...**
 
 ```

lcci/02.03.Delete Middle Node/Solution.js

@@ -0,0 +1,15 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} node
+ * @return {void} Do not return anything, modify node in-place instead.
+ */
+ var deleteNode = function(node) {
+    node.val = node.next.val
+    node.next = node.next.next
+};