LeetCode Reverse Linked List II

最新推荐文章于 2022-10-08 18:10:16 发布

kassical

最新推荐文章于 2022-10-08 18:10:16 发布

阅读量468

点赞数

分类专栏： LeetCode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/kassical/article/details/38765691

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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) {
		ListNode *pbefore = head, *pfirst = head;
		for (int i = 0; i < m - 1; i++) {
			pbefore = pfirst;
			pfirst = pfirst->next;
		}
		ListNode *pleft = pfirst, *pmid = pfirst->next, *pright = pfirst->next;
		for (int i = 0; i < n - m; i++) {
			pright = pmid->next;
			pmid->next = pleft;
			pleft = pmid;
			pmid = pright;
		}
		pfirst->next = pright;
		if (m == 1) {
			return pleft;
		}
		pbefore->next = pleft;
		return head;
	}
};