Remove Nth Node From End of List

最新推荐文章于 2024-06-20 12:29:29 发布

CodeAsWind

最新推荐文章于 2024-06-20 12:29:29 发布

阅读量489

点赞数

分类专栏： LeetCode 文章标签： LeetCode 链表结点删除

本文链接：https://blog.csdn.net/CodeAsWind/article/details/38052181

版权

LeetCode 专栏收录该内容

36 篇文章

订阅专栏

Remove Nth Node From End of List

Given a linked list, remove the n^th node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

解题思路：

先找出倒数第n个结点，再删除该结点。用三个指针可以完美完成！

Code:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *removeNthFromEnd(ListNode *head, int n)
{
	ListNode* p1=head;
	ListNode* p2=NULL;
	ListNode* pre=NULL;
	
	for(int i=0;i<n-1;i++)
	{
		p1=p1->next;
	}
	
	p2=head;
	while(p1->next!=NULL)
	{
		pre=p2;
		p2=p2->next;
		p1=p1->next;
	}

	/*
	ListNode *pNext=p2->next;
	p2->val=pNext->val;
	p2->next=pNext->next;
	pNext=NULL;
	*/
	if(pre!=NULL)
	    pre->next=p2->next;
	else
		head=head->next;
	return head;
}
};