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.
func removeNthFromEnd(head *ListNode, n int) *ListNode {
var p*ListNode=head
i:=0
for p.Next!=nil&&i<n-1{
p=p.Next
i++
}
if p.Next==nil{
head=head.Next
return head
}
first:=p
end:=head
for first.Next.Next!=nil{
first=first.Next
end=end.Next
}
end.Next=end.Next.Next
return head
}