题解 | #链表内指定区间反转#
链表内指定区间反转
https://www.nowcoder.com/practice/b58434e200a648c589ca2063f1faf58c
/** * struct ListNode { * int val; * struct ListNode *next; * }; */ class Solution { public: /** * * @param head ListNode类 * @param m int整型 * @param n int整型 * @return ListNode类 */ ListNode* reverseBetween(ListNode* head, int m, int n) { ListNode* cur = head; ListNode* pre = new ListNode(-1); ListNode* res = pre; pre->next = cur; for(int i = 1;i<m;i++){ pre = cur; cur = cur->next; } for(int i = m;i<n;i++){ ListNode* tmp = cur->next; cur->next = tmp->next; tmp->next = pre->next; pre->next = tmp; } return res->next; } };
本题易错点:
1.前往m节点的起始循环位为1,而非0;
2.链表翻转顺序为从后向前反转,注意方向;