LeetCode Reorder List

最新推荐文章于 2019-10-17 10:50:20 发布

weixin_34245749

最新推荐文章于 2019-10-17 10:50:20 发布

阅读量66

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/whyandinside/p/5294258.html

本文介绍了一种链表重组算法，该算法将链表分为两部分并反转第二部分，然后交错合并两部分。文章提供了详细的实现步骤及源代码。

struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
	void reorderList(ListNode* head)
	{
		if(head == nullptr) return;
		int size = 0;
		ListNode *ptr = head;
		while(ptr != nullptr)
		{
			size++;
			ptr = ptr->next;
		}
		if(size <= 2) return;
		int breakpoint = (size + 1) / 2;
		int i = 0;
		ptr = head;
		while( i++ < breakpoint)
		{
			ptr = ptr->next;
		}
		ListNode *ptr2 = head;
		while(ptr2!= nullptr && ptr2->next != ptr)
			ptr2 = ptr2->next;
		if(ptr2 != nullptr)
			ptr2->next = nullptr;
		
		ListNode* newheadof2ndPart = reverseLinkedList(ptr);
		ptr = head;
		for(i = 0; i< breakpoint && ptr != nullptr && newheadof2ndPart != nullptr; i++)
		{
			ListNode*ptmp = ptr->next;
			ListNode*pnextnewhead = newheadof2ndPart->next;
			ptr -> next = newheadof2ndPart;
			newheadof2ndPart->next = ptmp;
			ptr = ptmp;
			newheadof2ndPart = pnextnewhead;
		}
	}
	
	ListNode* reverseLinkedList(ListNode* head)
	{
		if(head == nullptr) return nullptr;
		ListNode* newhead = reverseLinkedList(head->next);
		if(head-> next != nullptr)
		{
			head->next->next = head; //Error, 一定要搞清楚到底是哪个next哦
		}
		if(newhead == nullptr) newhead = head;
		head->next = nullptr;
		
		return newhead;
	}
	
};

转载于:https://www.cnblogs.com/whyandinside/p/5294258.html