单向链表按某值划分成左边小、中间相等、右边大的形式

方法一：开一个数组，放到数组中，然后利用荷兰国旗法排序

//单向链表按某值划分成左边小、中间相等、右边大的形式
//利用辅助数组
void ListSort(List head, int num)
{
	vector<int >v;
	List  p = head;
	p = p->next;
	while (p != NULL)
	{
		v.push_back(p->val);
		p = p->next;
	}

	int cur = 0;
	int x = -1;
	int y = v.size();
	while (cur < y)
	{
		if (v[cur] < num)
		{
			swap(v[cur++], v[++x]);
		}
		else if (v[cur > num])
		{
			swap(v[cur], v[--y]);
		}
		else
		{
			cur++;
		}
	}
	List now = head->next;
	vector<int>::iterator beg = v.begin();
	vector<int>::iterator end = v.end();
	while (beg != end)
	{
		now->val = (*beg++);
		now = now->next;
		
	}
}

方法二：开六个指针less小于某值开头
less_end 小于某值结尾
equ等于某值开头
equ_end等于某值的结尾
more大于某值的开头
more_end大于某值的结尾

//不利用辅助数组
List LSort(List head,int num)
{
	List p = head;
	List less=NULL;
	List less_end = NULL;
	List equ = NULL;
	List equ_end = NULL;
	List more = NULL;
	List more_end = NULL;
	List cur = p->next;
	while (cur != NULL)
	{
		List temp = cur->next;
		if (cur->val < num)
		{
			if (less == NULL)
			{
				less = cur;
			}
			else
			{
				less_end->next = cur;
			}
			less_end = cur;
		}
		else if (cur->val==num)
		{
			if (equ == NULL)
			{
				equ = cur;
			}
			else
			{
				equ_end->next = cur;
			}
			equ_end = cur;
		}
		else
		{
			if (more == NULL)
			{
				more = cur;
			}
			else
			{
				more_end->next = cur;
			}
			more_end = cur;
		}

	}
	List res = NULL;//开始拼接
	if (less != NULL)
	{
		res = less;
		if (equ != NULL)
		{
			less_end->next = equ;
			equ_end->next = more;
		}
		else
			less_end->next = more;
	}
	else
	{
		if (equ != NULL)
		{
			res = equ;
			equ_end->next = more;
		}
		else
			res = more;
	}
	return res;
}