单链表我懂了吗

• 单链表求中点结点。思路快慢指针

public ListNode getMid(ListNode left,ListNode right){
	ListNode slow = left;
	listNode fast= left;
	while(fast != right && fast.next != right){
		fast = fast.next;
		fast = fast.next;
		slow = slow.next;
	}
	return slow;
}

• 判断单链表中是否有环并且找出环的入口点

/*找到入口点*/
public ListNode getEntrance(ListNode head){
	ListNode havecycle = getEncounter(head);
	if(havecycle != null){
		ListNode ptr1 = head;
		ListNode ptr2 = havecycle;
		while(ptr1 != ptr2){
			ptr1 = ptr1.next;
			ptr2 = ptr2.next;
		}
		return ptr1;
	}
	return null;
	
}
/*获取相遇结点 如果为null 代表无环*/
public ListNode getEncounter(ListNode head){
	ListNode slow = head;
	ListNode fast = head;
	while(fast != null && fast.next != null){
		slow = slow.next;
		fast = fast.next;
		fast = fast.next;
		if(slow == fast){
			return slow;
		}
	}
	return null;
}