Sort a list with down pointer_sort down-优快云博客

本文介绍了如何使用C++对包含下链指针的链表进行排序，通过定义节点结构体和实现排序算法，实现了链表的有序排列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a link list with right pointers and each element of the list has a down link contains another link list with down pointers as:

 5 -> 7 -> 9 -> 18
 |    |    |    |
10    6    14   20
 |    |    |    |
11    8    19   22
 |    |         |
12    13        24
 |    
15

// Sort a list with down pointer.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <stdlib.h>

typedef struct node
{
	int num;
	struct node *right;
	struct node *down;
} Node;


Node *getNextNode(Node **ppNodes, int size)
{
	Node *pRetNode = NULL;
	Node *pCurNode = NULL;
	int  curIdx = 0;

	for (int i=0; i<size; i++)
	{
		if (ppNodes[i] != NULL)
		{
			pCurNode = ppNodes[i];
			curIdx = i;
			break;
		}
	}

	if (pCurNode == NULL)
		return NULL;

	for (int i = 0; i < size; i++)
	{
		if (ppNodes[i] != NULL)
		{
			if (ppNodes[i]->num < pCurNode->num)
			{
				pCurNode = ppNodes[i];
				curIdx = i;
			}
		}
	}

	pRetNode = pCurNode;
	ppNodes[curIdx] = pCurNode->down;

	return pRetNode;
}

Node* sortList(Node *rootNode)
{
	if (rootNode == NULL)
		return NULL;

	int listSize = 0;
	Node *pCurNode = rootNode;

	while (pCurNode)
	{
		listSize++;
		pCurNode = pCurNode->right;
	}

	Node **ppNodes = NULL;
	ppNodes = (Node **)malloc(listSize*sizeof(Node *));

	//ppNodes = new (Node *)[listSize];

	pCurNode = rootNode;

	for (int i=0; i<listSize; i++)
	{
		ppNodes[i] = pCurNode;
		pCurNode = pCurNode->right;
	}

	//Node *pNewRoot = pCurNode = rootNode;
	Node *pNewRoot = NULL;

	Node *pNextNode = getNextNode(ppNodes, listSize);

	while (pNextNode != 0)
	{
		Node *pNewNext = new Node;
		pNewNext->num = pNextNode->num;

		if (pNewRoot == NULL)
		{
			pNewRoot = pCurNode = pNewNext;
			pNextNode = getNextNode(ppNodes, listSize);
			continue;
		}

		pCurNode->right = pNewNext;
		pCurNode = pCurNode->right;

		pNextNode = getNextNode(ppNodes, listSize);
	}
	pCurNode->right = NULL;
	free(ppNodes);

	return pNewRoot;
}

void printList(Node *pRootNode)
{
	Node *pCurNode = pRootNode;
	Node *pDeleteNode;

	while (pCurNode)
	{
		printf("%d->", pCurNode->num);
		pDeleteNode = pCurNode;
		pCurNode = pCurNode->right;

		delete pDeleteNode;
	}
	printf("NULL\r\n");
}

int _tmain(int argc, _TCHAR* argv[])
{
	Node N1, N2, N3, N4;
	Node N5, N6, N7, N8, N9, N10, N11, N12, N13, N14, N15, N16;

	N1.num = 5;
	N2.num = 6;
	N3.num = 9;
	N4.num = 18;
	N5.num = 10;
	N6.num = 7;
	N7.num = 14;
	N8.num = 20;
	N9.num = 11;
	N10.num = 8;
	N11.num = 19;
	N12.num = 22;
	N13.num = 12;
	N14.num = 13;
	N15.num = 24;
	N16.num = 15;

	N1.right = &N2;
	N2.right = &N3;
	N3.right = &N4;
	N4.right = NULL;

	N1.down = &N5;
	N5.down = &N9;
	N9.down = &N13;
	N13.down = &N16;
	N16.down = NULL;

	N2.down = &N6;
	N6.down = &N10;
	N10.down = &N14;
	N14.down = NULL;

	N3.down = &N7;
	N7.down = &N11;
	N11.down = NULL;

	N4.down = &N8;
	N8.down = &N12;
	N12.down = &N15;
	N15.down = NULL;

	Node *newList = sortList(&N1);

	printList(newList);


	return 0;
}