solve problem Middle Of The Linked List

Author: P-ppc

README.md

@@ -219,6 +219,7 @@ All solutions will be accepted!
 |458|[Poor Pigs](https://leetcode-cn.com/problems/poor-pigs/description/)|[java/py/js](./algorithms/PoorPigs)|Easy|
 |558|[Quad Tree Intersection](https://leetcode-cn.com/problems/quad-tree-intersection/description/)|[java/py](./algorithms/QuadTreeIntersection)|Easy|
 |874|[Walking Robot Simulation](https://leetcode-cn.com/problems/walking-robot-simulation/description/)|[java/py/js](./algorithms/WalkingRobotSimulation)|Easy|
+|876|[Middle Of The Linked List](https://leetcode-cn.com/problems/middle-of-the-linked-list/description/)|[java/py/js](./algorithms/MiddleOfTheLinkedList)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/MiddleOfTheLinkedList/README.md

@@ -0,0 +1,2 @@
+# Middle Of The Linked List
+This problem is easy to solve

algorithms/MiddleOfTheLinkedList/Solution.java

@@ -0,0 +1,25 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode middleNode(ListNode head) {
+        int length = 0;
+        ListNode p = head;
+        
+        while (p != null) {
+            p = p.next;
+            length++;
+        }
+        p = head;
+        
+        for (int i = 0; i < length / 2; i++) {
+            p = p.next;
+        }
+        return p;
+    }
+}

algorithms/MiddleOfTheLinkedList/solution.js

@@ -0,0 +1,27 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var middleNode = function(head) {
+    let length = 0,
+        p = head
+    
+    while (p) {
+        p = p.next
+        length++
+    }
+    p = head
+    
+    for (let i = 0; i < parseInt(length / 2); i++) {
+        p = p.next
+    }
+    
+    return p
+};

algorithms/MiddleOfTheLinkedList/solution.py

@@ -0,0 +1,21 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def middleNode(self, head):
+        """
+        :type head: ListNode
+        :rtype: ListNode
+        """
+        length = 0
+        p = head
+        while p:
+            p = p.next
+            length += 1
+        p = head
+        for i in xrange(length / 2):
+            p = p.next
+        return p