【leetcode刷题】19. Remove Nth Node From End of List

最新推荐文章于 2019-07-14 12:22:06 发布

liff_lee

最新推荐文章于 2019-07-14 12:22:06 发布

阅读量178

点赞数

分类专栏： leetcode刷题 golang

本文链接：https://blog.csdn.net/m0_38103546/article/details/88702158

版权

leetcode刷题同时被 2 个专栏收录

171 篇文章 0 订阅

订阅专栏

golang

16 篇文章 2 订阅

订阅专栏

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.

Note:

Given n will always be valid.

package main

 type ListNode struct {
	Val int
	Next *ListNode
 }
 func removeNthFromEnd(head *ListNode, n int) *ListNode {
	dummy := new(ListNode)
	dummy.Next = head
	first := dummy
	second := dummy
	for i:=1; i<=n+1; i++ {
		first = first.Next
	}
	for first!=nil{
		first = first.Next
		second = second.Next
	}
	second.Next = second.Next.Next
	return dummy.Next
}

func main(){

}