LeetCode --- 19. Remove Nth Node From End of List

19. Remove Nth Node From End of List

Difficulty: Medium

Given a linked list, remove the n-th node from the end of list and return its head.

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.

Follow up:

Could you do this in one pass?

思路

题目希望你能否遍历一遍链表完成操作。
使用两个指针，第一个指针首先找到开始和需要删除位置的距离节点。
如果pre节点为空，说明当前只有一个元素，head=head->next，返回即可;
如果pre->next不为空，cur跟着pre指针向下移动，找到要删除的元素。OK

Solution

Language: C++

/**
 * 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 head;
        ListNode *pre = head, *cur = head;
        for (int i = 0; i < n; i ++){
            pre = pre->next;
        }
        if (pre == NULL){
            head = head->next;
            return head;
        }
        while (pre->next != NULL){
            pre = pre->next;
            cur = cur->next;
        }
        cur->next = cur->next->next;
        return head;
    }
};