ListNode *reverseBetween(ListNode *head, int m, int n) {
ListNode dummy(-1);
dummy.next=head;
ListNode* pre=&dummy;
for(int i=1;i<m;i++){
pre=pre->next;
}
ListNode* mid=pre->next;
for (int i =m;i<n;i++){
ListNode* nextnode=mid->next;
mid->next=nextnode->next;
nextnode->next=pre->next;
pre->next=nextnode;
}
return dummy.next;
LeetCode-Reverse Linked List II
最新推荐文章于 2024-05-18 16:06:33 发布