#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef struct Node
{
int data;
struct Node * pNext;
}NODE,*PNODE;
PNODE create_list(void);
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE);
void sort_list(PNODE);
bool insert_list(PNODE pHead,int pos,int val);
bool delete_list(PNODE pHead,int pos,int * pVal);
int main(void)
{
PNODE pHead=NULL;
int val;
pHead=create_list();
//insert_list(pHead,4,33);
if(delete_list(pHead,4,&val))
{
printf("删除成功,删除元素是:%d\n",val);
}
else
{
printf("删除失败,删除元素不存在\n");
}
traverse_list(pHead);
//bool is_empty(pHead);
int len=length_list(pHead);
printf("链表长度为%d\n",len);
if(is_empty(pHead))
printf("链表为空\n");
else
printf("链表不为空\n");
//sort_list(pHead);
//traverse_list(pHead);
return 0;
}
PNODE create_list(void)
{
int len;
int i;
int val;
PNODE pHead=(PNODE)malloc(sizeof(NODE));
if (NULL==pHead)
{
printf("分配失败,程序中止\n");
exit(-1);
}
PNODE pTail=pHead;
pTail->pNext=NULL;
printf("请输入生成链表节点个数:len=");
scanf("%d",&len);
for (i=0;i<len;++i)
{
printf("请输入第%d个节点值:",i+1);
scanf("%d",&val);
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(NULL==pNew)
{
printf("分配失败,程序终止\n");
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 (NULL!=p)
{
printf("%d ",p->data);
p=p->pNext;
}
printf("\n");
return;
}
bool is_empty(PNODE pHead)
{
if(NULL==pHead->pNext)
return true;
else
return false;
}
int length_list(PNODE pHead)
{
PNODE p=pHead->pNext;
int len=0;
while(NULL!=p)
{
++len;
p=p->pNext;
}
return len;
}
void sort_list(PNODE pHead)
{
int i,j,t;
int len=length_list(pHead);
PNODE p,q;
for (i=1,p=pHead->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)
{
t=p->data;
p->data=q->data;
q->data=t;
}
}
}
return;
}
bool insert_list(PNODE pHead,int pos,int val)
{
int i=1;
PNODE p=pHead;
while (NULL!=p&&i<pos)
{
p=p->pNext;
++i;
}
if (i>pos||NULL==p)
return false;
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(NULL==pNew)
{
printf("动态分配失败\n");
exit(-1);
}
pNew->data=val;
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;
while(NULL!=p->pNext && i<pos-1)
{
p=p->pNext;
++i;
}
if(i>pos-1 || NULL==p->pNext)
return false;
PNODE q=p->pNext;
*pVal=q->data;
p->pNext=p->pNext->pNext;
//free(q);
return true;
}
#include<malloc.h>
#include<stdlib.h>
typedef struct Node
{
int data;
struct Node * pNext;
}NODE,*PNODE;
PNODE create_list(void);
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE);
void sort_list(PNODE);
bool insert_list(PNODE pHead,int pos,int val);
bool delete_list(PNODE pHead,int pos,int * pVal);
int main(void)
{
PNODE pHead=NULL;
int val;
pHead=create_list();
//insert_list(pHead,4,33);
if(delete_list(pHead,4,&val))
{
printf("删除成功,删除元素是:%d\n",val);
}
else
{
printf("删除失败,删除元素不存在\n");
}
traverse_list(pHead);
//bool is_empty(pHead);
int len=length_list(pHead);
printf("链表长度为%d\n",len);
if(is_empty(pHead))
printf("链表为空\n");
else
printf("链表不为空\n");
//sort_list(pHead);
//traverse_list(pHead);
return 0;
}
PNODE create_list(void)
{
int len;
int i;
int val;
PNODE pHead=(PNODE)malloc(sizeof(NODE));
if (NULL==pHead)
{
printf("分配失败,程序中止\n");
exit(-1);
}
PNODE pTail=pHead;
pTail->pNext=NULL;
printf("请输入生成链表节点个数:len=");
scanf("%d",&len);
for (i=0;i<len;++i)
{
printf("请输入第%d个节点值:",i+1);
scanf("%d",&val);
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(NULL==pNew)
{
printf("分配失败,程序终止\n");
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 (NULL!=p)
{
printf("%d ",p->data);
p=p->pNext;
}
printf("\n");
return;
}
bool is_empty(PNODE pHead)
{
if(NULL==pHead->pNext)
return true;
else
return false;
}
int length_list(PNODE pHead)
{
PNODE p=pHead->pNext;
int len=0;
while(NULL!=p)
{
++len;
p=p->pNext;
}
return len;
}
void sort_list(PNODE pHead)
{
int i,j,t;
int len=length_list(pHead);
PNODE p,q;
for (i=1,p=pHead->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)
{
t=p->data;
p->data=q->data;
q->data=t;
}
}
}
return;
}
bool insert_list(PNODE pHead,int pos,int val)
{
int i=1;
PNODE p=pHead;
while (NULL!=p&&i<pos)
{
p=p->pNext;
++i;
}
if (i>pos||NULL==p)
return false;
PNODE pNew=(PNODE)malloc(sizeof(NODE));
if(NULL==pNew)
{
printf("动态分配失败\n");
exit(-1);
}
pNew->data=val;
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;
while(NULL!=p->pNext && i<pos-1)
{
p=p->pNext;
++i;
}
if(i>pos-1 || NULL==p->pNext)
return false;
PNODE q=p->pNext;
*pVal=q->data;
p->pNext=p->pNext->pNext;
//free(q);
return true;
}