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.

题意： 找到两个链表的公共部分的起始点，若无公共部分则返回NULL。

思路：首先求得两个链表各自的长度m, n，然后将长的先多走m-n步以调节齐平，然后再齐头并进的同步进行，找到第一个公共点停止。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
	ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
		int m, n;
		m = n = 0;
		ListNode *p, *q;
		p = headA;
		q = headB;
		//get length
		while (p){
			m++;
			p = p->next;
		}
		while (q){
			n++;
			q = q->next;
		}

		//aligning
		p = headA;
		q = headB;
		while (m > n){
			m--;
			p = p->next;
		}
		while (n > m){
			n--;
			q = q->next;
		}

		//search common node
		while (p != q){
			p = p->next;
			q = q->next;
		}
		
		return p;
	}
};