题目描述:
Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list.
Example:
Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL
将链表一段翻转,其他部分不变。先遍历至翻转起点,然后设定翻转次数,运用迭代的翻转链表的方法就可以了。
class Solution {
public:
ListNode* reverseBetween(ListNode* head, int m, int n) {
if(m==n||head==NULL) return head;
ListNode* pre_head=new ListNode(0);
pre_head->next=head;
ListNode* p=head;
ListNode* pre=pre_head;
int i=m-1;
while(i>0)
{
pre=p;
p=p->next;
i--;
}
int j=n-m;
while(j>0)
{
if(p!=NULL&&p->next!=NULL)
{
ListNode* temp=p->next;
p->next=p->next->next;
temp->next=pre->next;
pre->next=temp;
j--;
}
else break;
}
return pre_head->next;
}
};