//三个指针反转单链表
struct ListNode *reverserList(struct ListNode *head)
{
struct ListNode *p1 = NULL;
struct ListNode *p2 = head;
struct ListNode *p3 = head->next;
while (p2 != NULL)
{
p2->next =p1;
p1 = p2;
p2 = p3;
if (p3 != NULL)
{
p3 =p3->next;
}
}
}
//链表的中间结点(双指针倍速遍历,要是双数个链表停在中间的后面结点)
struct ListNode *middleNode(struct ListNode *head)
{
struct ListNode *fast =head;
struct ListNode *slow =head;
while (fast!= NULL)
{
fast =fast->next;
if (fast!= NULL)
break;
slow =slow->next;
fast =fast->next;
}
return slow;
}
//求倒数第k个结点往后
struct ListNode *FindKthToTail(struct ListNode *pListHead, int k)
{
int i;
struct ListNode *front= pListHead;
struct ListNode *back =pListHead;
for ( i =0; front != NULL && i < k; i++)
{
front =front->next;
}
if (i <k)
{
return NULL;
}
while (front)
{
front =front->next;
back =back->next;
}
return back;
}
链表基础面试题(部分)
猜你喜欢
转载自blog.csdn.net/weixin_43767691/article/details/89322684
今日推荐
周排行