algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0019.删除链表的倒数第N个节点.md

Browse Source 
修改python版本为：fast先走n+1步 （旧版本是fast走n步，然后判断fast.next!=None），这样与上面的讲解一致
This commit is contained in:
ZerenZhang2022
2023-03-05 16:21:15 -05:00
committed by GitHub
parent 408c8f3ae9
commit 5e08d1b810
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0019.删除链表的倒数第N个节点.md
View File

@ -129,10 +129,10 @@ class Solution:
head_dummy.next = head head_dummy.next = head
slow, fast = head_dummy, head_dummy slow, fast = head_dummy, head_dummy
while(n!=0): #fast先往前走n步 while(n>=0): #fast先往前走n+1步
fast = fast.next fast = fast.next
n -= 1 n -= 1
while(fast.next!=None): while(fast!=None):
slow = slow.next slow = slow.next
fast = fast.next fast = fast.next
#fast 走到结尾后，slow的下一个节点为倒数第N个节点 #fast 走到结尾后，slow的下一个节点为倒数第N个节点