剑指offer：两个链表的第一个公共结点

最新推荐文章于 2017-09-09 14:31:20 发布

faithenXX

最新推荐文章于 2017-09-09 14:31:20 发布

阅读量227

点赞数

分类专栏：剑指offer 文章标签：剑指offer 链表

本文链接：https://blog.csdn.net/zyf19930610/article/details/70255285

版权

剑指offer 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

题目描述

输入两个链表，找出它们的第一个公共结点。

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        int size1 = getLength(pHead1);
		int size2 = getLength(pHead2);
		if (size1 == 0 || size2 == 0)
			return NULL;
		int longer = size1 - size2;
		if (size1 > size2)
		{
			for (int i = 0; i < longer; ++i)
				pHead1 = pHead1->next;
		}
		else if (size1 < size2)
		{
			for (int i = 0; i < -longer; ++i)
				pHead2 = pHead2->next;
		}
		while (pHead1 != NULL && pHead2 != NULL)
		{
			if (pHead1 == pHead2)
				return pHead1;
			pHead1 = pHead1->next;
			pHead2 = pHead2->next;
		}
		return NULL;
    }
    
    int getLength(ListNode* pHead)
	{
		int l=0;
		while (pHead != NULL)
		{
			pHead = pHead->next;
		    l++;
		}
		return l;
	}
};