一、题目地址
https://www.nowcoder.com/practice/b58434e200a648c589ca2063f1faf58c?tpId=188&&tqId=38555&rp=1&ru=/activity/oj&qru=/ta/job-code-high-week/question-ranking
二、思路地址
https://www.bilibili.com/video/BV1Q64y1W7WC?from=search&seid=16509048501336145638&spm_id_from=333.337.0.0
三、具体代码
function reverseBetween( head , m , n ) {
let dummy = new ListNode(-1);
dummy.next = head;
let current = dummy;
for(let i=0; i<m-1; i++) {
current = current.next;
}
let temp = current.next;
for(let i=0; i<n-m; i++) {
let next = temp.next;
temp.next = next.next;
next.next = current.next;
current.next = next;
}
return dummy.next;
}
module.exports = {
reverseBetween : reverseBetween
};