Commit 4c080d2

authored

Update 几道常见的链表算法题.md

1 parent 18a4dea commit 4c080d2Copy full SHA for 4c080d2

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -324,7 +324,7 @@ public class Solution {`
`324`	`324`	`进阶——一次遍历法:`
`325`	`325`
`326`	`326`
`327`		`-> **链表中倒数第N个节点也就是正数第(L-N+1)个节点。`
	`327`	`+> 链表中倒数第N个节点也就是正数第(L-N+1)个节点。`
`328`	`328`
`329`	`329`	`其实这种方法就和我们上面第四题找"链表中倒数第k个节点"所用的思想是一样的。基本思路就是: 定义两个节点 node1、node2;node1 节点先跑,node1节点跑到第 n+1 个节点的时候,node2 节点开始跑.当node1 节点跑到最后一个节点时,node2 节点所在的位置就是第 (L-n ) 个节点(L代表总链表长度,也就是倒数第 n+1 个节点)`
`330`	`330`

Comments

(0)