LeetCode 30 days challenge: Middle of the Linked List

题目名称 Middle of the Linked List

题目描述：
Given a non-empty, singly linked list with head node head, return a middle node of linked list.

If there are two middle nodes, return the second middle node.

例子：

Example 1:

Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.

Example 2:

Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.

我的理解
最初的想法是两次遍历，第一次遍历可以得到链表的长度，就可以知道长度一半上取整的值是多少，故第二次遍历可以找到中间位置。时间复杂度是o(kn)。

其实链表题很多情况下都会使用快慢指针。快慢指针有一个特点，就是快指针每次走两步，慢指针每次走一步，相当于快指针比慢指针的速度大1。如果次数为t，快指针就比慢指针多走t步, 好巧不巧慢指针也刚好走了t步。也就是说不管次数为多少，慢指针刚刚好在快指针和起点的中间位置上。

C++ solution

class Solution {
public:
   ListNode* middleNode(ListNode* head) {
		ListNode *slow = head, *fast = head;
		while (fast && fast->next) {
			slow = slow->next;
			fast = fast->next->next;
		}
		return slow;
    }
};