描述:
给定一个链表,删除链表中倒数第n个节点,返回链表的头节点。
注意事项
链表中的节点个数大于等于n
样例:
给出链表1->2->3->4->5->null和 n = 2.
删除倒数第二个节点之后,这个链表将变成1->2->3->5->null.
思路:
跑一下链表求一下链表的长度length,然后循环到length-n个节点,将它的next指向next的next就OK了~
/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param head: The first node of linked list.
* @param n: An integer.
* @return: The head of linked list.
*/
ListNode *removeNthFromEnd(ListNode *head, int n) {
// write your code here
ListNode *rear=new ListNode(0), *r,*p;
rear->next=head;
r=rear;
head=rear;
int sum=-1,i;
while(head!=NULL)
{
sum++;
head=head->next;
}
for(i=-1;i<sum-n-1;i++)
{
r=r->next;
}
r->next=r->next->next;
return rear->next;
}
};