求未知长度的单链表的中间节点

最新推荐文章于 2023-11-24 21:31:41 发布

原创最新推荐文章于 2023-11-24 21:31:41 发布 · 358 阅读

CC 4.0 BY-SA版权

#include <iostream>
#include <cstdio>
using namespace std;
typedef int ElemType;
#define OK 1
typedef struct Node
{
	ElemType data;
	struct Node* Next;
}Node;
typedef struct Node* LinkList;
//定义快慢指针，快指针的速度为慢指针的2倍，快指针指到表尾，慢指针指到中间
ElemType GetMidNode(LinkList L, ElemType *e)
{
	LinkList search, mid;
	mid = search = L;
	if (search->Next->Next!=NULL)
	{
		search = search->Next->Next;
		mid = mid->Next;
	}
	else
	{
		search = search->Next;
	}
	*e = mid->data;
	return OK;
}