https://leetcode.cn/problems/reverse-linked-list-ii/
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} left
* @param {number} right
* @return {ListNode}
*/
var reverseBetween = function (head, left, right) {
let ret = new ListNode(null, head), pre = ret, n = right - left + 1
while (--left) {
pre = pre.next
}
pre.next = reverse(pre.next, n)
return ret.next
};
var reverse = function (head, n) {
let pre = null, cur = head
while (n--) {
[cur.next, pre, cur] = [pre, cur, cur.next]
}
head.next = cur
return pre
}
原创文章，作者：czhdawn，如若转载，请注明出处：https://www.czhdawn.cn/archives/4877
