Partition List 二分链表(重）

最新推荐文章于 2022-03-01 23:12:34 发布

阿萨德发的阿达

最新推荐文章于 2022-03-01 23:12:34 发布

阅读量552

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/skyoceanlover/article/details/38952545

版权

题目：

点击打开链接

解答：

类似于快排的二分，注意头尾节点，

代码：

class Solution {
public:
	ListNode *partition(ListNode *head, int x) {
		ListNode *little, *large;
		ListNode *largeHead = NULL;
		ListNode *littleHead = NULL;
		little = large = NULL;
		ListNode *temp = head;
		while (temp)
		{
			if (temp->val < x)
			{
				//头结点
				if (little == NULL)
				{
					little = temp;
					littleHead = little;
				}
				else
				{
					little->next = temp;
					little = little->next;
				}
			}
			else
			{
				//头结点
				if (large == NULL)
				{
					large = temp;
					largeHead = large;
				}
				else
				{
					large->next = temp;
					large = large->next;
				}
			}
			temp = temp->next;