leetcode160~Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3

begin to intersect at node c1.
Notes:

If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.

=====
求两个链表的交叉节点；如果无交叉节点则返回null；要求O(N)时间复杂度和O(1)内存空间。

public class IntersectionofTwoLinkedLists {
	
	/*
	 * 统计两个链表的长度，然后使用俩指针，让长链表的指针先走lenA-lenB步，然后再一起走
	 */
	public ListNode getIntersectionNode1(ListNode headA, ListNode headB) {
        if(headA==null || headB==null) return null;
        
        int lenA = getLength(headA);
        int lenB = getLength(headB);
        
        //长链表先走len1-len2步
        while(lenA>lenB) {
        	headA = headA.next;
        	lenA--;
        }
        while(lenA<lenB) {
        	headB = headB.next;
        	lenB--;
        }
        //同时遍历
        while(headA != null && headB != null && headA != headB) {
        	headA = headA.next;
        	headB = headB.next;
        }
        if(headA != null && headB !=null && headA == headB) {
			return headA;
		}
        return null;
	}

	private int getLength(ListNode head) {
		int len = 0;
		while(head!=null) {
			head = head.next;
			len++;
		}
		return len;
	}
	//一个链表遍历到尾部时，从另外一个链表的头部开始再次遍历，最终会相遇
	//这种解法的前提是两个链表肯定有交叉点，否则会陷入死循环；或者在外层对次数进行限制，即每个链表在遍历到尾部然后从另外一个链表的头部重新开始遍历，这种过程只会出现一次
	public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
		if(headA==null || headB==null) return null;
		ListNode curA = headA;
		ListNode curB = headB;
		while(curA!=curB) {
			curA = curA==null? headB:curA.next;
			curB = curB==null? headA:curB.next;
		}
		return curA;
	}
}