链表|链表的增删改查（源码分析）链表的增删改查（源码分析）

【链表|链表的增删改查（源码分析）】链表的增删改查（源码分析）
Code:

#include
#include
#include
struct Node
{
char *City;
int Temp;
struct Node *Next;
};
typedef struct Node *Link;
Link Head;
int NodeCount;
int AddNodeAscend(Link);
int DuplicateNode(Link,Link);
void CreateList(void);
int DeleteNode(Link);
void FreeNode(Link);
void ShowNodes(void);
int NodeCmp(Link,Link);
/* -----function definition*/
int AddNodeAscend(Link to_add)
{
Link pn,
prev,
curr;
struct Node dummy;
int i;
pn = (Link)malloc(sizeof(struct Node));
if(NULL== pn)
{
return 0;
}
memcpy(pn,to_add,sizeof(struct Node));
/*--set up a dummy node to simply logic*/
dummy.Next = Head;
prev = &dummy;
curr = Head;
/* ---insert node pn--*/
for( ; ; prev = curr,curr = curr->Next)
{
if(NULL == curr)
break;
i = NodeCmp(pn,curr);
if(i<=0)
break;
}
if(0==curr && i)
if(DuplicateNode(curr,pn)==0)
return (1);
prev->Next = pn;
pn->Next = curr;
Head = dummy.Next;
return (1);
}
int DuplicateNode(Link inlist,Link duplicate)
{
FreeNode(duplicate);
return (0);
}
int DeleteNode(Link to_delete)
{
Link curr,
prev;
int i;
/*Is there anything in the list?----*/
if(NULL == Head)
return (0);
for(prev = NULL,curr = Head;
curr !=NULL&&(i=NodeCmp(to_delete,curr))>0;
prev =curr,curr = curr->Next)
/*Find a match ,so delete it ---*/
if(curr !=NULL&&i==0)
{
if(prev)
prev->Next = curr->Next;
else
Head = curr->Next;
FreeNode(curr);
NodeCount -=1;
return (1);
}
return (0);
}
int NodeCmp(Link a,Link b)
{
/*returns 1,0,-1 ,depending on whether
*the data in a is
*greater,equal,or less than b
*
*/
if(a->Temp!=b->Temp)
return (a->Temp-b->Temp);
else
return strcmp(a->City,b->City);
}
void CreateList(void)
{
Head =NULL;
NodeCount = 0;
}
void FreeNode(Link n)
{
free(n->City);
free(n);
}
void ShowNodes(void)
{
Link pn;
int count,median;
for(count=0,pn=Head; pn; pn= pn->Next)
count+=1;
//compute the median Node;
median =count/2+1;
if(count)
{
count = 0;
for(pn=Head; pn ; pn=pn->Next)
{
printf("%-20s:%3d",pn->City,pn->Temp);
count+=1;
if(count == median)
printf("---Median---");
printf("/n");
}
}
else
{
printf("Empty list /n");
}
}
int main(int argc,char *argv[])
{
FILE *fin;
char buffer[120];
struct Node n;
if(argc !=2)
{
fprintf(stderr,"Usage:citytemp filename.ext/n");
exit(EXIT_FAILURE);
}
fin = fopen(argv[1],"rt");
if(fin == NULL)
{
fprintf(stderr,"Cannot open/find %s/n",argv[2]);
exit(EXIT_FAILURE);
}
while (!feof(fin))
{
if(fgets(buffer,127,fin)==NULL)
break;
buffer[strlen(buffer-1)]='/0';
n.City = strdup(buffer+3);
buffer[3] = '/0';
n.Temp = atoi(buffer);
if(AddNodeAscend(&n)==0)
{
fprintf(stderr,"Error adding node.abborting/n");
exit(EXIT_FAILURE);
}
}
ShowNodes();
printf("/n");
DeleteNode(Head);
ShowNodes();
while(Head && Head->Next)
{
printf("/n");
DeleteNode(Head->Next);
ShowNodes();
}
printf("/n");
DeleteNode(Head);
ShowNodes();
fclose(fin);
return (EXIT_SUCCESS);
}

链表|链表的增删改查（源码分析）

推荐阅读

苏若禹对林书豪凶狠犯规后,在网上被球迷们谩骂侮辱,书豪出面为他解围,你怎么评价？

芒果可以和酸奶同吃吗芒果可以和酸奶同吃吗

HTML常见标签用法

Win10系统下mmc控制台关闭按钮不见了怎么办？

节食减肥有用吗明显如何减肥，减肥多久能看出来瘦了

养生保健归根到底多吃五谷

今日猪肉水产价格「国内猪肉价格今日价」

红碎茶茶色的科学分析

酸菜鱼香豆腐的做法酸菜鱼香豆腐的做法是什么

申通正在派件的快递多久到货

运行出现博世冰箱声音大怎么解决？

鳕鱼猪血粥——补气养血促进大脑发育

腮腺炎的预防措施有哪些？腮腺炎的预防针有必要打吗

阳光房顶棚遮阳帘

林内壁挂炉显示e4,小松鼠壁挂炉e4故障怎么处理

idea怎么写javafx，myeclipse2014 怎么弄javafx

休要丢人现眼打一字休要丢人现眼打一字谜打一字

兄弟打印机怎么清零7080-兄弟7080d更换墨粉盒怎么清零

战双帕弥什渡边好吗战双帕弥什渡边使用技巧

孕晚期感觉燥热是男孩孕妇为什么热

链表|链表 的 增删改查（源码分析）

推荐阅读

链表|链表的增删改查（源码分析）