[Leetcode] #160 Intersection of Two Linked Lists

Discription:

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.

Solution:

我的解法：

ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
	int sizeA = 0, sizeB = 0;
	ListNode *temp1 = headA, *temp2 = headB;
	while (temp1){
		temp1 = temp1->next;
		sizeA++;
	}
	while (temp2){
		temp2 = temp2->next;
		sizeB++;
	}
	if (sizeA < sizeB)
		return getIntersectionNode(headB, headA);
	sizeA = sizeA - sizeB;
	while (sizeA-->0){
		headA = headA->next;
	}
	temp1 = headA, temp2 = headB;
	while (temp1){
		if (temp1 == temp2)
			return temp1;
		temp1 = temp1->next;
		temp2 = temp2->next;
	}
	return NULL;
}

Leetcode上参考解法：

ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
    ListNode *cur1 = headA, *cur2 = headB;
    while(cur1 != cur2){
        cur1 = cur1?cur1->next:headB;
        cur2 = cur2?cur2->next:headA;
    }
    return cur1;
}

GitHub-LeetCode:  https://github.com/wenwu313/LeetCode