链表反转-迭代-7天带你刷完LeetCode算法,最新最详细的讲解方法!
热门回复:
- 伧俗_:public static ListNode iterate(ListNode head) {
ListNode prev = null;
ListNode curr = head;
while (curr != null) {
ListNode next = head.next;
head.next = prev;
prev = curr;
curr = next;
}
return prev;
}
- 霹雳旋风猫:三连了!吃灰去吧[doge][doge][doge]
- 啦啦啦拯救者:请问有每节课代码嘛
- 斯沃福德:诶呀我去,看题解一直卡在返回元素那里。。看UP解答终于懂了。。。。。。。[大哭]
- gmgw0909:俺也是铜陵学院的 12计算机[微笑]