定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
class Solution {
public ListNode reverseList(ListNode head) {
ListNode node = head ,res = null,temp = null;
while(head != null){
temp = head.next;
head.next = res;
res = head;
head = temp;
}
return res;
}
}