#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
typedef struct Node
{
int data;
struct Node *pNext;
}NODE,*PNODE;
PNODE create_list();
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE pHead);
bool insert_list(PNODE pHead,int pos,int value);
bool delete_list(PNODE pHead,int pos,int *);
void sort_list(PNODE);
int main(void){
PNODE pHead=NULL;
int val;
pHead=create_list();
traverse_list(pHead);
sort_list(pHead);
printf("排序后的链表:\n");
traverse_list(pHead);
if(!insert_list(pHead,0,111)){
printf("insert失败\n");
}
printf("insert后的链表:\n");
traverse_list(pHead);
if(!delete_list(pHead,0,&val)){
printf("delete失败\n");
}else{
printf("delete成功,删除的数据:%d\n",val);
}
printf("delete后的链表:\n");
traverse_list(pHead);
return 0;
}
PNODE create_list(){
int len;
int i;
int val;
PNODE pHead=(PNODE)malloc(sizeof(NODE));
if(pHead==NULL){
exit(-1);
}
PNODE pTail=pHead;
pTail->pNext=NULL;
printf("请输入您需要的链表节点个数:");
scanf("%d",&len);
for(i=0;i<len;++i){
printf("请输入第%d个节点的值:",i+1);
scanf("%d",&val);
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(pHead==NULL){
exit(-1);
}
pNew->data=val;
pTail->pNext=pNew;
pNew->pNext=NULL;
pTail=pNew;
}
return pHead;
}
void traverse_list(PNODE pHead){
PNODE p=pHead->pNext;
while(p!=NULL){
printf("%d ",p->data);
p=p->pNext;
}
printf("\n");
return;
}
bool is_empty(PNODE pHead)
{
if(pHead->pNext==NULL){
return true;
}else{
return false;
}
}
int length_list(PNODE pHead){
PNODE p=pHead->pNext;
int len=0;
while(p!=NULL){
++len;
p=p->pNext;
}
return len;
}
void sort_list(PNODE pHead){
int i,j,t;
PNODE p,q;
int len=length_list(pHead);
for(i=0,p=pHead->pNext;i<len-1;i++,p=p->pNext)
{
for(j=i+1,q=p->pNext;j<len;j++,q=q->pNext)
{
if(p->data > q->data)
{
t=p->data;
p->data=q->data;
q->data=t;
}
}
}
}
bool insert_list(PNODE pHead,int pos,int value)
{
int i=0;
PNODE p=pHead;
int len=length_list(pHead);
if(pos<0||p==NULL||pos>len)
{
return false;
}
while(p!=NULL && i<=pos-1)
{
p=p->pNext;
i++;
}
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(pNew==NULL)
{
printf("动态分配内存失败");
exit(-1);
}
pNew->data=value;
PNODE q=p->pNext;
p->pNext=pNew;
pNew->pNext=q;
return true;
}
bool delete_list(PNODE pHead,int pos,int * pVal)
{
int i=0;
PNODE p=pHead;
int len=length_list(pHead);
if(pos<0||p==NULL||pos>=len)
{
return false;
}
while(p!=NULL && i<=pos-1)
{
p=p->pNext;
i++;
}
PNODE q=p->pNext;
*pVal=q->data;
p->pNext=p->pNext->pNext;
free(q);
q=NULL;
return true;
}