原题:
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.
问题描述:给定以链表,删除倒数第n个节点,并返回头指针。
思路:双指针法,用一个头指针先走n步,另一个尾指针开始走,当头指针到链表尾部时,尾指针所指位置为要删除的节点。将节点删除即可。
注意:要删除的节点是第一个节点的情况
/**
* 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 *current = head;
ListNode *pre = head;
ListNode *temp = head;
int num = 0;
while(++num != n) //头指针先走n步
pre = pre->next;
while(pre->next != NULL) // 如果头指针没有到达链表尾部
{
pre = pre->next;
temp = current; //记录第二个指针和它前面的指针
current = current->next;
}
if(current == head) //指针没移动,说明要删除的为头节点
head=head->next;
else
temp->next = current->next;//删除节点n
return head;
}
};