剑指 Offer 24. 反转链表
剑指 Offer 24. 反转链表
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
这道题。。。写过好几遍了
数据结构与算法—线性表—反转链表
来,再写一遍
思路1:递归
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;
}
}
思路2:非递归
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
//边界条件
if(head == null || head.next == null) return head;
ListNode newHead = new ListNode(-1);
while(head != null){
//先把head.next存储下来
ListNode tempNode = head.next;
head.next = newHead.next;
newHead.next = head;
head = tempNode;
}
return newHead.next;
}
}