LeetCode19. Remove Nth Node From End of List（C++/Python）

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?

解题思路：一遍遍历法，双指针法，先让一个之前前进n个，再让两个同时遍历，直到第一个指针的next为NULL

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

Python

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        if n == 0:
            return head
        p, q = head, head
        for i in range(n):
            q = q.next
        while q and q.next:
            p = p.next
            q = q.next
        if q:
            p.next = p.next.next
        else:
            head = head.next
        return head