如何找到未知长度单链表的中间节点?
思路1: 遍历单链表获取长度n,n/2再遍历得到中间节点,时间复杂度为O(n+n/2)=O(3/2n)
思路2:利用快慢指针原理,设置两个指针*search,*mid,都指向单链表第一个元素,假设单链表有头结点,则为 search=mid=L->next,其中*search的移动速度是mid的2倍,当*search指向末尾节点的时候,mid正好在中间了,这也是标尺的思想,时间复杂度为O(n/2)
int getMidNode(LNode *C) {
LNode *search, *mid;
int s,m;
search = mid = C->next;
while ((search->next) != NULL) {
if ((search->next->next) != NULL) {
search = search->next->next;
s = search->data;
mid = mid->next;
m = mid->data;
}
else {
search = search->next;
}
}
int e = mid->data;
return e;
}