算：链表排序，反转

最垃圾的链表排序，容我后面改，，，，，

菜，

不合格，不能借助数组，而且你的翻转只是值的翻转。

 

最垃圾的排序，没有之一，，，

容我改改，md

struct NodeList* sort(struct NodeList* phead)
{//the most foolish sort 
	NodeList* PCur=NULL;
	NodeList* PNext=NULL;
	int len=lenoflist(phead);

	printf("\nenter sort--------------------------------\n");
	for(int i=0;i<len;i++)
	{//goto the head again
		PCur=phead->mNext;
		PNext=PCur->mNext;

		for(int k=0;k<len;k++)
		{
			if(PCur->mData > PNext->mData)
			{//swap
				//printf("before %d %d ",PCur->mData , PNext->mData);	
				int temp=PCur->mData;
				PCur->mData=PNext->mData;
				PNext->mData=temp;
				//printf("after %d %d \n",PCur->mData , PNext->mData);	
			}			
			if(PNext->mNext)
			{//not reach the end of list
				PCur=PCur->mNext;
				PNext=PNext->mNext;
			}
		}
		displaylist(phead);
	}
	return phead;
}





int main()
{
	//initNodeList();

	int i=0;
	int arry[]={5,8,11,12,19,6,4};
	int arry2[]={6,9,1,4,8,2};
	PList* pcurrent=NewNodeMore(arry,sizeof(arry)/sizeof(arry[0]));//get the head of list
	printf("\n\n--------------------------------\n");
	PList* pcurrent2=NewNodeMore(arry2,sizeof(arry2)/sizeof(arry2[0]));//get the head of list
	displaylist(pcurrent);
	displaylist(pcurrent2);

	//merge
	PList* pmerge=merge2list(pcurrent,pcurrent2);//get the head of list
	displaylist(pmerge);

	//find the pos of value
	int valuetofind=88;
	PList* node=findNode(pcurrent2,valuetofind);
	printf("\n node:%p,node->mData:%d,node->mNext:%p\n",node,node->mData,node->mNext);


	//insert value 
	int pos_val=11;
	int insert_val=666;
	//find pos_val in pcurrent,then insert insert_val 
	insertNode(pcurrent,findNode(pcurrent,pos_val),insert_val);
	displaylist(pcurrent);

	//modify value 
	modifyNode(pcurrent,pos_val,insert_val);//modify pos_val to insert_val 
	displaylist(pcurrent);

	//delete node
	deleteNode(pcurrent,findNode(pcurrent,19));//delete the node 9
	displaylist(pcurrent);

	sort(pcurrent);
	printf("\nsort--------------------------------\n");
	displaylist(pcurrent);
	printf("\nsort--------------------------------\n");

	return 0;
}

 

结果：

 

 

 

链表翻转：

struct NodeList* reverse(struct NodeList* phead)
{//
	NodeList* PCur=NULL;
	PCur=phead->mNext;
	int len=lenoflist(phead);
	int i=0;
	int temp[len+1]={0};

	printf("reverse:%d \n",len);
	while(PCur)
	{//not reach the end of list
		temp[i++]=PCur->mData;
		PCur=PCur->mNext;
		//printf("%d ",temp[i]);
	}
	
	PCur=phead->mNext;
	while(PCur)
	{//not reach the end of list
		if(i>=0)
		{
			PCur->mData=temp[--i];
			//printf("%d ",temp[i]);
			PCur=PCur->mNext;
		}
	}
	return phead;
}




int main()
{
	//initNodeList();

	int i=0;
	int arry[]={5,8,11,12,19,6,4};
	int arry2[]={6,9,1,4,8,2};
	PList* pcurrent=NewNodeMore(arry,sizeof(arry)/sizeof(arry[0]));//get the head of list
	printf("\n\n--------------------------------\n");
	PList* pcurrent2=NewNodeMore(arry2,sizeof(arry2)/sizeof(arry2[0]));//get the head of list
	displaylist(pcurrent);
	displaylist(pcurrent2);

	//merge
	PList* pmerge=merge2list(pcurrent,pcurrent2);//get the head of list
	displaylist(pmerge);

	//find the pos of value
	int valuetofind=88;
	PList* node=findNode(pcurrent2,valuetofind);
	printf("\n node:%p,node->mData:%d,node->mNext:%p\n",node,node->mData,node->mNext);


	//insert value 
	int pos_val=11;
	int insert_val=666;
	//find pos_val in pcurrent,then insert insert_val 
	insertNode(pcurrent,findNode(pcurrent,pos_val),insert_val);
	displaylist(pcurrent);

	//modify value 
	modifyNode(pcurrent,pos_val,insert_val);//modify pos_val to insert_val 
	displaylist(pcurrent);

	//delete node
	deleteNode(pcurrent,findNode(pcurrent,19));//delete the node 9
	displaylist(pcurrent);

	//sort
	sort(pcurrent);
	printf("\nsort--------------------------------\n");
	displaylist(pcurrent);
	
	
	//reverse
	printf("\nbefore reverse--------------------------------\n");
	displaylist(pcurrent);
	reverse(pcurrent);
	printf("\nafter reverse--------------------------------\n");
	displaylist(pcurrent);
	return 0;
}

 

结果终于对了，主要是数组的边界和链表的头和尾要重点注意