题目描述
输入一个链表,反转链表后,输出新链表的表头。
示例1
输入
{1,2,3}
返回值
{3,2,1}
在线链接
非递归解法
/*
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 pre = null;
ListNode next = head.next;
while (head != null) {
head.next = pre;
pre = head;
head = next;
if(next != null){
next = next.next;
}
}
return pre;
}
}
思路概述:
两个指针,next记录下一个移动的位置,pre记录上一个结点的位置,通过改变head的next指针指向pre来做到反转,然后让pre移动到head的位置,head移动到next位置,next向后移动(要注意如果已经为null了,则不用再移动了)
递归解法:
/*
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 p = ReverseList(head.next);
head.next.next = head;
head.next = null;
return p;
}
}