-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRemoveNthNodeFromEndofList.h
More file actions
62 lines (54 loc) · 1.34 KB
/
RemoveNthNodeFromEndofList.h
File metadata and controls
62 lines (54 loc) · 1.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/**************************************
* Author : luoshikai
* Version : 1.0
* Date : 2013-10-10
* Email : [email protected]
*************************************/
/**************************************
* 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.
*************************************/
/**
* 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 *first = head, *second = head;
while (n--)
{
first = first->next;
}
if (first == NULL)
{
head = head->next;
delete second;
return head;
}
while (first->next)
{
first = first->next;
second = second->next;
}
ListNode *temp = second->next;
second->next = temp->next;
delete temp;
return head;
}
};