一、递归方法
先保存头节点的next,然后再把头节点置空,
递归,再把新节点的next指回旧节点。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head==null||head.next==null) return head;
ListNode next=head.next;
head.next=null;
ListNode newHead=ReverseList(next);
next.next=head;
return newHead;
}
}
二、迭代
用头插法:
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head==null||head.next==null) return head;
ListNode newList=new ListNode(-1);
while(head!=null)
{
ListNode next=head.next;
head.next=newList.next;
newList.next=head;
head=next;
}
return newList.next;
}
}