经典题目,直接贴代码
package com.vleus.algorithm.linked_list;
public class ReverseLinkedList {
public ListNode reverseList1(ListNode head) {
ListNode curr = head;
ListNode prev = null;
while (curr != null) {
ListNode tempNext = curr.next;
curr.next = prev;
prev = curr;
curr = tempNext;
}
return curr;
}
public ListNode reverseList(ListNode head) {
if (head == null || head.next == null) {
return head;
}
ListNode restHead = head.next;
ListNode reversedRest = reverseList(restHead);
restHead.next = head;
head.next = null;
return reversedRest;
}
}