python3 解法, 执行用时: 44 ms, 内存消耗: 14.8 MB, 提交时间: 2022-11-23 16:20:16

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        dummy = ListNode(0, head)
        first, second = head, dummy
        for i in range(n):
            first = first.next
        
        while first != None:
            second = second.next
            first = first.next
        
        second.next = second.next.next
        return dummy.next

golang 解法, 执行用时: 0 ms, 内存消耗: 2.1 MB, 提交时间: 2022-11-23 16:17:30

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func removeNthFromEnd(head *ListNode, n int) *ListNode {
    dummy := &ListNode{0, head}
    first, second := head, dummy
    for i := 0; i < n; i++ {
        first = first.Next
    }
    for ; first != nil; first = first.Next {
        second = second.Next
    }
    second.Next = second.Next.Next
    return dummy.Next

}