【LeetCode】 Remove Nth Node From End of List 【python C++】做法详解

题目，从listnode 中删除倒数第n个点

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.

解答：

1、首先我们需要找到倒数第n，正着数是第几个

2、我们用cur和pre一起指向head节点，把cur节点往前走N个，那么cur剩下的长度就是我们所需要的长度

3、把cur走空，pre跟着cur一起走，当cur走到NULL的时候，pre正好走到了需要删除的那个点的前一个

4、把pre->next=pre->next->next 就可以了

5、处理当n=list的长度-1时的情况，在第2步后面增加一个判断，如果cur为空，那么head=head->next；

代码：

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

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

class Solution:
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        head2,head3=head,head
        for i in range(n):
            head2=head2.next
        if not head2:
            return head.next
        while head2.next:
            head3=head3.next
            head2=head2.next
        head3.next=head3.next.next
        return head