#include<bits/stdc++.h>
using namespace std;
typedef struct _PNODE
{
int data;
struct _PNODE *pNext;
}PNODE;
PNODE * create_list(void) //创建链表
{
int num;
int data;
PNODE *pHead = (PNODE *)malloc(sizeof(PNODE));
PNODE *pTail = pHead;
pTail->pNext = NULL;
printf("input list number:");
scanf("%d",&num);
getchar();
while(num--)
{
scanf("%d",&data);
PNODE *pNew = (PNODE *)malloc(sizeof(PNODE));
pNew->data = data;
pTail->pNext = pNew;
pTail = pNew;
pTail->pNext = NULL;
}
return pHead;
}
void print_list(PNODE *pHead) //打印链表
{
PNODE *cur = pHead->pNext;
if(pHead == NULL)
{
printf("print_list error\n");
return;
}
printf("output list member: ");
while(cur)
{
printf("%d ",cur->data);
cur = cur->pNext;
}
printf("\n");
}
bool is_empty(PNODE *pHead) //判断链表是否为空
{
if(pHead->pNext == NULL)
return true;
else
return false;
}
int length_list(PNODE *pHead) //求链表长度
{
if(is_empty(pHead))
return 0;
int len = 0;
PNODE *cur = pHead->pNext;
while(cur)
{
len++;
cur = cur->pNext;
}
return len;
}
bool insert_list(PNODE *pHead, int pos, int val) //在pHead所指向链表的第pos个节点的前面插入一个新的结点,该节点的值是val, 并且pos的值是从1开始
{
if(is_empty(pHead))
return false;
PNODE *cur = pHead;
int i = 0;
while( (cur != NULL) && (i<pos-1) )
{
cur = cur->pNext;
i++;
}
if(i>pos-1 || cur==NULL)
return false;
PNODE *pNew = (PNODE *)malloc(sizeof(PNODE));
pNew->data = val;
pNew->pNext = cur->pNext;
cur->pNext = pNew;
return true;
}
bool delete_list(PNODE *pHead, int pos, int * pVal) //删除链表第pos个节点,并将删除的结点的值存入pVal所指向的变量中, 并且pos的值是从1开始
{
if(is_empty(pHead))
return false;
PNODE *cur = pHead->pNext;
int i = 0;
while( (cur != NULL) && (i<pos-1) )
{
cur = cur->pNext;
i++;
}
if(i>pos-1 || cur==NULL)
return false;
PNODE *pNew = cur->pNext;
*pVal = pNew->data;
cur->pNext = pNew->pNext;
free(pNew);
pNew = NULL;
return true;
}
void sort_list(PNODE *pHead) //对链表进行排序
{
if(is_empty(pHead))
return ;
int i,j,temp;
int len = length_list(pHead);
PNODE *p,*q;
p = pHead;
for(i=0,p=p->pNext;i<len;i++,p=p->pNext)
for(j=i+1,q=p->pNext;j<len;j++,q=q->pNext)
{
if(p->data > q->data)
{
temp = q->data;
q->data = p->data;
p->data = temp;
}
}
}
void inver_list(PNODE *pHead) //对链表进行倒置
{
PNODE *p,*q,*t;
p = pHead->pNext;
q = p->pNext;
if(q == NULL)
return;
while(q)
{
t = q->pNext;
q->pNext = p;
p = q;
q = t;
}
pHead->pNext->pNext = NULL;
pHead->pNext = p;
}
int main()
{
int len;
int num;
PNODE *p = create_list();
print_list(p);
len = length_list(p);
printf("%d\n",len);
if(insert_list(p,2,10))
print_list(p);
if(delete_list(p,2,&num))
{
printf("%d\n",num);
print_list(p);
}
sort_list(p);
print_list(p);
inver_list(p);
print_list(p);
return 0;
}