首页 > 代码库 > [LeetCode] Reverse Linked List II
[LeetCode] Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note: Given m, n satisfy the following condition: 1 ≤ m ≤ n ≤ length of list.
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *reverseBetween(ListNode *head, int m, int n) { if(m==n) return head; int num = 1; ListNode *h = head; ListNode *Pm = head,*Pm_pre=NULL; while(num != m){ Pm_pre = Pm; Pm = Pm->next; num++; }//end while ListNode *p1 = Pm,*p2 = p1->next,*p3 = NULL; while(num!=n){ p3 = p2->next; p2->next = p1; p1 = p2; p2 = p3; num++; }//end while if(Pm_pre!=NULL){ Pm_pre->next = p1; Pm->next = p2; }else{ h = p1; Pm->next = p2; } return h; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。