mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
Fix 0019
This commit is contained in:
@ -20,8 +20,14 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
|
|||||||
var fast, slow *ListNode
|
var fast, slow *ListNode
|
||||||
fast = head
|
fast = head
|
||||||
slow = head
|
slow = head
|
||||||
|
step := 0
|
||||||
for i := 0; i < n; i++ {
|
for i := 0; i < n; i++ {
|
||||||
|
// n maybe much larger than length of linklist
|
||||||
|
if fast.Next == nil && step != 0 && step < n-1 {
|
||||||
|
return head
|
||||||
|
}
|
||||||
fast = fast.Next
|
fast = fast.Next
|
||||||
|
step++
|
||||||
}
|
}
|
||||||
if fast == nil {
|
if fast == nil {
|
||||||
head = head.Next
|
head = head.Next
|
||||||
|
@ -29,6 +29,21 @@ func Test_Problem19(t *testing.T) {
|
|||||||
|
|
||||||
qs := []question19{
|
qs := []question19{
|
||||||
|
|
||||||
|
{
|
||||||
|
para19{[]int{1, 2}, 2},
|
||||||
|
ans19{[]int{2}},
|
||||||
|
},
|
||||||
|
|
||||||
|
{
|
||||||
|
para19{[]int{1}, 1},
|
||||||
|
ans19{[]int{}},
|
||||||
|
},
|
||||||
|
|
||||||
|
{
|
||||||
|
para19{[]int{1, 2, 3, 4, 5}, 10},
|
||||||
|
ans19{[]int{1, 2, 3, 4, 5}},
|
||||||
|
},
|
||||||
|
|
||||||
{
|
{
|
||||||
para19{[]int{1, 2, 3, 4, 5}, 1},
|
para19{[]int{1, 2, 3, 4, 5}, 1},
|
||||||
ans19{[]int{1, 2, 3, 4}},
|
ans19{[]int{1, 2, 3, 4}},
|
||||||
|
@ -43,8 +43,14 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
|
|||||||
var fast, slow *ListNode
|
var fast, slow *ListNode
|
||||||
fast = head
|
fast = head
|
||||||
slow = head
|
slow = head
|
||||||
|
step := 0
|
||||||
for i := 0; i < n; i++ {
|
for i := 0; i < n; i++ {
|
||||||
|
// n maybe much larger than length of linklist
|
||||||
|
if fast.Next == nil && step != 0 && step < n-1 {
|
||||||
|
return head
|
||||||
|
}
|
||||||
fast = fast.Next
|
fast = fast.Next
|
||||||
|
step++
|
||||||
}
|
}
|
||||||
if fast == nil {
|
if fast == nil {
|
||||||
head = head.Next
|
head = head.Next
|
||||||
|
Reference in New Issue
Block a user