LeetCode 92. Reverse Linked List II

最新推荐文章于 2022-01-01 20:28:52 发布

stephen_wong

最新推荐文章于 2022-01-01 20:28:52 发布

阅读量683

点赞数

分类专栏： LeetCode LeetCode Problems 文章标签： LeetCode C++ LinkedList

本文链接：https://blog.csdn.net/stephen_wong/article/details/38166495

版权

LeetCode 同时被 2 个专栏收录

186 篇文章 0 订阅

订阅专栏

LeetCode Problems

183 篇文章 2 订阅

订阅专栏

代码：

class Solution 
{
public:
    ListNode *reverseBetween(ListNode *head, int m, int n) 
    {
    	if (head==NULL || m==n)
    	{
    		return head;
    	}

    	ListNode *cut=head, *cur=head;

    	for (int i = 1; i < m; ++ i)
    	{
    		cut = cur;
    		cur = cur->next;
    	}
    	ListNode* prev = cur;
    	cur = cur->next;
    	for (int i = 0; i < n-m; ++ i)
    	{
    		ListNode* next = cur->next;
    		cur->next = prev;
    		prev = cur;
    		cur = next;
    	}

    	if (m == 1)
    	{
    		head->next = cur;
    		return prev;    		
    	} else
    	{
	    	cut->next->next = cur;
    		cut->next = prev;
    		return head;
    	}
    }
};