/**
*快慢指针,前面是慢指针一次走一个节点,快指针一次走两个节点,
*直到快指针的后继节点为空。返回慢节点即可。
/
class Solution {
public ListNode middleNode(ListNode head) {
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode fast = dummy;
ListNode slow = dummy;
while(fast != null && fast.next != null){
fast = fast.next.next;
slow = slow.next;
}
return slow;
}
}
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/