题解 | #反转链表#
反转链表
http://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head == null || head.next == null) {
return head;
}
ListNode newHead = ReverseList(head.next);
// 递归出栈时链接节点
head.next.next = head;
head.next = null;
return newHead;
}
}
查看12道真题和解析