两个链表的第一个公共结点（面试题 37）

最新推荐文章于 2021-08-09 13:38:03 发布

水晶莲

最新推荐文章于 2021-08-09 13:38:03 发布

阅读量399

点赞数

分类专栏：剑指offer 文章标签：链表第一个公共点

本文链接：https://blog.csdn.net/a1231988/article/details/37092143

版权

剑指offer 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

#include "iostream"
using namespace std;
struct ListNode{
	int m_nKey;
	ListNode* m_pNext;
};

unsigned int GetListLength(ListNode* pHead)
{
	unsigned int nLength =0;
	ListNode* pNode =pHead;
	while(pNode!=NULL)
	{
		++nLength;
		pNode =pNode->m_pNext;
	}
	return nLength;
}

ListNode* FindFirstCommenNode(ListNode* pHead1,ListNode* pHead2)
{
	//得到两个链表的长度
	unsigned int nLength1 =GetListLength(pHead1);
	unsigned int nLength2 =GetListLength(pHead2);

	int nLengthDif =nLength1-nLength2;
	ListNode* pListHeadLong =pHead1;
	ListNode* pListHeadshort =pHead2;
	if (nLength2>nLength1)
	{
		pListHeadLong =pHead2;
		pListHeadshort =pHead1;
		nLengthDif =nLength2 -nLength1;
	}

	//先在长链表上走几步，再同时在两个链表上遍历
	for (int i=0;i<nLengthDif;i++)
	{
		pListHeadLong =pListHeadLong->m_pNext;
	}
	while((pListHeadLong!=NULL)&&(pListHeadshort !=NULL)&&(pListHeadLong !=pListHeadshort))
	{
		pListHeadshort =pListHeadshort->m_pNext;
		pListHeadLong =pListHeadLong->m_pNext;
	}
	ListNode* pFirstCommenNode =pListHeadLong;
	return pFirstCommenNode;
}