//双指针
//时间复杂度O(n) 空间复杂度O(1)
public ListNode middleNode(ListNode head) {
ListNode slow=head,fast = head;
while (fast!=null && fast.next!=null){
slow = slow.next;
fast = fast.next.next;
}
return slow;
}