1、遇到链表的问题,首先要记得判断head==NULL;
2、链表中查找某个结点时,通常用三个辅助指针来表示;
题目:
Given a linked list, remove the nth 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.
Note:
Given n will always be valid.
Try to do this in one pass.
思路:
1、设置三个辅助指针,指针p和q的间隔为n-1;
2、将设置好距离的指针向后移动,直至最后一个指针指到链表的最后一个位置为止;
3、判断所要删掉的是否为头结点(pPre==NULL),是则删掉头结点,否则删掉p指针所指的结点;
代码:
/**
* 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) {
if(head==NULL) return NULL;
ListNode *pPre=NULL;
ListNode *p=head;
ListNode *q=head;
for(int i=0;i<n-1;i++)
{
q=q->next;
}
while(q->next)
{
pPre=p;
p=p->next;
q=q->next;
}
if(pPre==NULL)
{
head=p->next;
delete p;
}
else
{
pPre->next=p->next;
delete p;
}
return head;
}
};