【LeetCode】19. Remove Nth Node From End of List

Problem

给定链表，从链表末尾删除第n个节点并返回其头部

Algorithmic thinking

https://leetcode.com/problems/remove-nth-node-from-end-of-list/discuss/8802/3-short-Python-solutions
My first solution is “cheating” a little. Instead of really removing the nth node, I remove the nth value. I recursively determine the indexes (counting from back), then shift the values for all indexes larger than n, and then always drop the head.

Python 3 solution

class Solution:

    def removeNthFromEnd(self, head_, n):
        def remove(head):
            if not head:
                return 0, head
            i, head.next = remove(head.next)
            return i+1, (head, head.next)[i+1 == n]
        return remove(head_)[1]