1. 题目描述
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2. 题解
1、我的提交
当修改节点的链接方向时,需要记录三个节点,即 前一节点、当前节点、后一节点。
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
//做题用时13min28s
if(head === null || head.next === null){
return head;
}
let pnode = head;
let pnext = head.next;
pnode.next = null;
while(pnext){
let pnext2 = pnext.next;
pnext.next = pnode;
pnode = pnext;
pnext = pnext2;
}
return pnode;
};
2、更简洁的版本
var reverseList = function(head) {
let curr = head;
let prev = null;
while(curr){
let pnext = curr.next;
curr.next = prev;
prev = curr;
curr = pnext;
}
return prev;
};