leetcode 876. 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.

 

Note:

• The number of nodes in the given list will be between 1 and 100.

思路：超级简单，几分钟就写完了。具体做法：设置快慢指针fast和low，fast一次移动两个节点，low一次移动一个节点。当快指针移动到链表尾部，慢指针刚好移动到中间节点。注意一下结束条件和奇偶节点个数。在草稿纸上画一下就好了。

代码：

class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode cur=head;
        ListNode post=cur;
        head=null;
        while(cur!=null){
            post=cur.next;
            cur.next=head;
            head=cur;
            cur=post;
        }
        return head;
    }
}