coding-interviews/36.cpp at master · bodhiye/coding-interviews · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <iostream>

using namespace std;

struct ListNode
{
	int val;
	ListNode* next;
	ListNode(int x) :val(x), next(NULL) {}
	ListNode() {}
};

ListNode* newList()
{
	ListNode* L = new ListNode;
	L->next = NULL;
	ListNode* q = L;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		ListNode *p = new ListNode;
		cin >> p->val;
		q->next = p;
		q = p;
	}
	q->next = NULL;
	return L->next;
}

ListNode* FindFirstCommonNode(ListNode* pHead1, ListNode* pHead2)
{
	ListNode* p1 = pHead1;
	ListNode* p2 = pHead2;
	while (p1 != p2)
	{
		p1 = (p1 != NULL ? p1->next : pHead2);
		p2 = (p2 != NULL ? p2->next : pHead1);
	}
	return p1;
}

int main()
{
	ios::sync_with_stdio(false);
	ListNode* L1 = newList();
	ListNode* L2 = newList();
	cout << FindFirstCommonNode(L1, L2)->val << endl;
	return 0;
}