We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent de3ddaf commit 974969fCopy full SHA for 974969f
data_structure/linked_list.md
@@ -83,6 +83,7 @@ public ListNode deleteDuplicates(ListNode head) {
83
> 反转一个单链表。
84
85
思路:用一个 prev 节点保存向前指针,temp 保存向后的临时指针
86
+//如果不保存 前向,后向指针,那在头插法使用过程中,未免破坏原链条,需要new ListNode复制节点,内存开销大.不破坏原链条,是本题的难点
87
88
```java
89
public ListNode reverseList(ListNode head) {
0 commit comments