LeetCode143 Reorder List 链表重排列

最新推荐文章于 2021-07-28 16:11:10 发布

tigerhuli

最新推荐文章于 2021-07-28 16:11:10 发布

阅读量117

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/m0_37518259/article/details/82531102

版权

LeetCode 专栏收录该内容

503 篇文章 3 订阅

订阅专栏

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You may not modify the values in the list's nodes, only nodes itself may be changed.

Example 1:

Given 1->2->3->4, reorder it to 1->4->2->3.

Example 2:

Given 1->2->3->4->5, reorder it to 1->5->2->4->3.

题源：here；完整实现：here

思路：

我们使用一个vector将所有的节点记录下来，然后就可以方便地按照题目中要求的顺序重新排列了。

void reorderList(ListNode* head) {
	vector<ListNode*> nodes;
	ListNode *curr = head;
	while (curr){
		nodes.push_back(curr);
		curr = curr->next;
	}
	int left = 0, right = nodes.size()-1;
	if (right <= 0) return;
	while (left < right){
		nodes[left]->next = nodes[right];
		nodes[right]->next = nodes[left + 1];
		left++;
		right--;
	}
	if (left == right)
		nodes[right]->next = NULL;
	else
		nodes[left]->next = NULL;
}