题目:
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:输入:head = []
输出:[]
提示:
链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/reverse-linked-list
思路:采用递归的方法!if判断原链表是否未空值。若不为空值则递归。
var reverseList = function(head) {
return reverse(null, head);
};
var reverse = function(pre, head) {
if(!head) {
return pre;
}
const temp = head.next;
head.next = pre;
pre = head
return reverse(pre, temp);
}