题目:
Given a linked list, remove the nth node from the end of list and return its head.
For 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.
Try to do this in one pass.
链接:https://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/
描述:删除链表中第n个节点,要求遍历一次。快慢指针的思路,一次遍历的要求其实没什么意思。
solution by python:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @return a ListNode
def removeNthFromEnd(self, head, n):
node = ListNode(-1)
node.next = head
fast = node
for i in range(n): fast = fast.next
slow = node
while fast.next != None:
fast = fast.next
slow = slow.next
slow.next = slow.next.next
return node.next