剑指 Offer 24. 反转链表
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
注意:本题与主站 206 题相同:https://leetcode-cn.com/problems/reverse-linked-list/
/**
* 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) {return head;}
// if(head.next == null) { return head;}
// ListNode last = reverseList(head.next);
// head.next.next = head;
// head.next = null;
// return last;
// }
// 迭代实现
public ListNode reverseList(ListNode head) {
if(head == null) {return head;}
// if(head.next == null) { return head;}
ListNode pre = null, cur = head, next;
while(cur.next != null) {
next = cur.next;
cur.next = pre;
pre = cur;
cur = next;
}
cur.next = pre;
return cur;
}
}