题目要求:
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.
首先试图遍历链表,计算链表长度,然后判断如果删除为链表第一个元素,返回以原链表第二元素为头指针的链表,否则找到要删除指针的前一个节点,更改其next值
代码如下:
/**
* 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->next == NULL && n == 1)
return NULL;
//统计链表长度
int len = 0;
ListNode *temp = head;
while(temp != NULL)
{
len++;
temp = temp->next;
}
if(len == n)
return head->next;
temp = head;
for(int i = 1; i < len - n; i++)
{
temp = temp->next;
}
(n == 1) ? (temp->next = NULL) : temp->next = (temp->next)->next;
return head;
}
};