algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 17:44:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 19. Remove Nth Node From End of List.go

Browse Source 
fix: when m(length of linkList) is 1 and n greater than m, will cause "nil pointer dereference"
This commit is contained in:
mfzzz
2021-04-15 02:35:26 +08:00
committed by GitHub
parent d47c2ec4c3
commit 858198e385
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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