描述
反转一个单链表。
示例
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
思路
遍历反转即可,注意修改节点后指针之前保留下一个节点引用,别让链表断掉
代码
/**
* 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 before = null;
while(head.next != null){
ListNode next = head.next;
head.next = before;
before = head;
head = next;
}
head.next = before;
return head;
}
}