【LeetCode】160.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.

解答：

相交后的部分长度都一样，之前的长度不一样，对齐后一起移动比较即可。需要先求出各自的长度，长度差就是对齐需要移动的长度。有个小技巧：遍历求长度时，如果尾节点不一样，则没有相交。

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
		if(headA == null || headB == null)
			return null;
		int lenA = 1,lenB = 1;
		ListNode curA = headA;
		ListNode curB = headB;
		while(curA.next != null){
			lenA++;
			curA = curA.next;
		} // now curA points to the tail of A
		
		while(curB.next != null){
			lenB++;
			curB = curB.next;
		}  // now curB points to the tail of B
		
		// different tail node means no intersection
		if(curA != curB)
			return null;
		else { // intersection exists!
			int diff = lenA - lenB;
			// align
			if(diff >= 0){ // A go 
				for(int i=0;i<diff;i++){
					headA = headA.next;
				}
			}else{
				for(int i=0;i<-diff;i++){
					headB = headB.next;
				}
			}
			// find the intersection node
			while(true){
				if(headA == headB)
					return headA;
				else{
					headA = headA.next;
					headB = headB.next;
				}
			}
		}
	}
}