Commit d38a1b5

committed

Linked List Recursion implementation remove function bug fixed.

1 parent 6419bec commit d38a1b5Copy full SHA for d38a1b5

File tree

+13

-3

lines changed

05-Recursion/Optional-01-Recursive-LinkedList/src
- LinkedListR.java
- Solution.java

+13

-3

lines changed

Lines changed: 12 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`import javafx.util.Pair;`
`2`	`2`
`3`	`3`	`/// 递归实现的LinkedList`
`4`		`-/// 类名称中LinkedListR里的R,是Resursion的意思,表示递归实现:)`
	`4`	`+/// 类名称中LinkedListR里的R,是Recursion的意思,表示递归实现:)`
`5`	`5`	`public class LinkedListR<E> {`
`6`	`6`
`7`	`7`	`private class Node{`
`@@ -151,7 +151,7 @@ private Pair<Node, E> remove(Node node, int index){`
`151`	`151`	`return new Pair<>(node.next, node.e);`
`152`	`152`	`Pair<Node, E> res = remove(node.next, index - 1);`
`153`	`153`	`node.next = res.getKey();`
`154`		`- return res;`
	`154`	`+ return newPair<>(node, res.getValue());`
`155`	`155`	`}`
`156`	`156`
`157`	`157`	`// 从链表中删除第一个元素, 返回删除的元素`
`@@ -195,4 +195,14 @@ public String toString(){`
`195`	`195`
`196`	`196`	`return res.toString();`
`197`	`197`	`}`
	`198`	`+`
	`199`	`+ public static void main(String[] args) {`
	`200`	`+`
	`201`	`+ LinkedListR<Integer> list = new LinkedListR<>();`
	`202`	`+ for(int i = 0 ; i < 10 ; i ++)`
	`203`	`+ list.addFirst(i);`
	`204`	`+`
	`205`	`+ while(!list.isEmpty())`
	`206`	`+ System.out.println("removed " + list.removeLast());`
	`207`	`+ }`
`198`	`208`	`}`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -158,7 +158,7 @@ private Pair<Node, E> remove(Node node, int index){`
`158`	`158`	`return new Pair<>(node.next, node.e);`
`159`	`159`	`Pair<Node, E> res = remove(node.next, index - 1);`
`160`	`160`	`node.next = res.getKey();`
`161`		`- return res;`
	`161`	`+ return newPair<>(node, res.getValue());`
`162`	`162`	`}`
`163`	`163`
`164`	`164`	`// 从链表中删除第一个元素, 返回删除的元素`

Comments

(0)