algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2026-03-13 10:02:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #132 from NovaHe/fix/19

Browse Source 
fix/19: clean up code
This commit is contained in:
halfrost
2021-05-17 01:22:55 +08:00
committed by GitHub
parent 851946dc9a 5e77733f1a
commit 0d64196cf1
2 changed files with 18 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
leetcode/0019.Remove-Nth-Node-From-End-of-List/19. Remove Nth Node From End of List.go
View File

@@ -17,31 +17,18 @@ type ListNode = structures.ListNode
// 解法一
func removeNthFromEnd(head *ListNode, n int) *ListNode {
if head == nil {
return nil
}
var fast, slow *ListNode
fast = head
slow = head
step := 0
for i := 0; i < n; i++ {
// n maybe much larger than length of linklist
if fast.Next == nil && step < n-1 {
return head
dummyHead := &ListNode{Next: head}
preSlow, slow, fast := dummyHead, head, head
for fast != nil {
if n <= 0 {
preSlow = slow
slow = slow.Next
}
n--
fast = fast.Next
step++
}
if fast == nil {
head = head.Next
return head
}
for fast.Next != nil {
fast = fast.Next
slow = slow.Next
}
slow.Next = slow.Next.Next
return head
preSlow.Next = slow.Next
return dummyHead.Next
}
// 解法二

35
website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
View File

@@ -52,7 +52,6 @@ Output: [1]
## 代码
```go
package leetcode
import (
@@ -72,31 +71,18 @@ type ListNode = structures.ListNode
// 解法一
func removeNthFromEnd(head *ListNode, n int) *ListNode {
if head == nil {
return nil
}
var fast, slow *ListNode
fast = head
slow = head
step := 0
for i := 0; i < n; i++ {
// n maybe much larger than length of linklist
if fast.Next == nil && step < n-1 {
return head
dummyHead := &ListNode{Next: head}
preSlow, slow, fast := dummyHead, head, head
for fast != nil {
if n <= 0 {
preSlow = slow
slow = slow.Next
}
n--
fast = fast.Next
step++
}
if fast == nil {
head = head.Next
return head
}
for fast.Next != nil {
fast = fast.Next
slow = slow.Next
}
slow.Next = slow.Next.Next
return head
preSlow.Next = slow.Next
return dummyHead.Next
}
// 解法二
@@ -136,9 +122,6 @@ func removeNthFromEnd1(head *ListNode, n int) *ListNode {
}
return head
}
```