【题目】
实现反转单向链表的函数
【代码】
public ListNode reverseList(ListNode head) {
ListNode pre = null;
ListNode next = null;
while(head != null){
next = head.next;
head.next = pre;
pre = head;
head = next;
}
return pre;
}
【题目】
实现双向链表的函数
/**
public class DoubleNode {
public DoubleNode last;
public DoubleNode next;
public int value;
public DoubleNode(int value) {
this.value = value;
}
}
*/
private DoubleNode reverseList(DoubleNode head) {
DoubleNode pre = null;
DoubleNode next = null;
while (head != null) {
next = head.next;
head.next = pre;
head.last = next;
pre = head;
head = next;
}
return pre;
}