求未知长度链表的中间结点---快慢指针

优点：普通方法需将链表完全遍历，使用快慢指针将时间缩短了一半
版本一：问题所在—-一旦链表的节点是偶数循环错误

include

using namespace std;

struct node{
int value;
struct node * next;
};
typedef struct node* Node;

bool initNode(Node *head);
bool insert_tail(Node head, int value);
void print(Node head);

int main()
{
Node head = nullptr;
initNode(&head);
for (int i = 0; i < 10; i++)
{
insert_tail(head, i);
}
print(head);
Node fastNode = head;//快速指针
Node slowNode = head;//慢速指针
while (fastNode->next->next != head)
{
fastNode = fastNode->next->next;
slowNode = slowNode->next;
cout << “slowNode->value：” << slowNode->value << endl;

}
cout << "中间结点的值：" << slowNode->next->value << endl;
system("pause");

}

bool initNode(Node *head)
{
Node newnode = (Node)malloc(sizeof(struct node));
if (NULL == newnode)
{
return false;
}
newnode->next = newnode;
*head = newnode;
}

bool insert_tail(Node head, int value)
{
Node temp = head;//固定头结点位置，利用temp去遍历链表
Node newnode = (Node)malloc(sizeof(struct node));
if (NULL == newnode)
{
return false;
}
newnode->value = value;
newnode->next = head;
while (temp->next != head)//temp遍历到链表的尾
{
temp = temp->next;
}
temp->next = newnode;
return true;
}

void print(Node head)
{
Node temp = head;
while (temp->next != head)
{
cout << temp->next->value;
temp = temp->next;
}
cout << endl;
}

修改版本：while条件循环确保遍历正确
int main()
{
Node head = nullptr;
initNode(&head);
for (int i = 0; i < 10; i++)
{
insert_tail(head, i);
}
print(head);
Node fastNode = head;//快速指针
Node slowNode = head;//慢速指针
while (fastNode->next != head)
{
if (fastNode->next->next != head)
{
fastNode = fastNode->next->next;//快速指针以两倍速度遍历链表
slowNode = slowNode->next;
cout << “slowNode->value：” << slowNode->value << endl;
}
else
{
fastNode = fastNode->next;
}
}
cout << “中间结点的值：” << slowNode->next->value << endl;
system(“pause”);
}