c link list 实现代码,C代码库,德仔网

代码语言
代码分类
【C】 c link list 实现
作者: / 发布于2011/3/15/ 445
<div>
<span style="font-size: 16px">#include <stdio.h></span>
<span style="font-size: 16px">#include <stdlib.h></span>
<span style="font-size: 16px">#include <malloc.h></span>

<span style="font-size: 16px">#define LEN sizeof(struct node)</span>

<span style="font-size: 16px">typedef char DataType;</span>

<span style="font-size: 16px">typedef struct node{</span>
<span style="font-size: 16px">DataType name;</span>
<span style="font-size: 16px">struct node *next;</span>
<span style="font-size: 16px">} listnode;</span>

<span style="font-size: 16px">typedef listnode *linklist;</span>

<span style="font-size: 16px">//创建单链表</span>

<span style="font-size: 16px">linklist link_list_create(){</span>
<span style="font-size: 16px">linklist L;</span>
<span style="font-size: 16px">listnode *p1;</span>
<span style="font-size: 16px">listnode *p2;</span>
<span style="font-size: 16px">char data;</span>
<span style="font-size: 16px">L = (listnode *)malloc(LEN);</span>
<span style="font-size: 16px">if(L==NULL){</span>
<span style="font-size: 16px">printf("\n动态开辟空间失败 Line : %d\n",__LINE__);</span>
<span style="font-size: 16px">exit(-1);</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">p2 = L;</span>
<span style="font-size: 16px">while((data = getchar())!='\n'){</span>
<span style="font-size: 16px">p1 = (listnode*)malloc(LEN);</span>
<span style="font-size: 16px">if(p1==NULL){</span>
<span style="font-size: 16px">printf("\n动态开辟空间失败 Line : %d\n",__LINE__); </span>
<span style="font-size: 16px">exit(-1);</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">p1->name = data;</span>
<span style="font-size: 16px">p2->next = p1;</span>
<span style="font-size: 16px">p2 = p1;</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">p2->next = NULL;</span>
<span style="font-size: 16px">return L;</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">//输出单链表</span>
<span style="font-size: 16px">int print_link_list(linklist L){</span>
<span style="font-size: 16px">listnode *p;</span>
<span style="font-size: 16px">p = L->next;</span>
<span style="font-size: 16px">while(p!=NULL){</span>
<span style="font-size: 16px">printf("\n%c\n",p->name);</span>
<span style="font-size: 16px">p = p->next;</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">printf("\n");</span>
<span style="font-size: 16px">return 0;</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">//插入单链表</span>

<span style="font-size: 16px">int insert_e_link_list(linklist L, int pos, DataType e){</span>
<span style="font-size: 16px">//插入的位置是否存在</span>
<span style="font-size: 16px">listnode *t;</span>
<span style="font-size: 16px">listnode *p;</span>
<span style="font-size: 16px">t = L;</span>
<span style="font-size: 16px">int k = 0;</span>
<span style="font-size: 16px">while(t!=NULL && k<pos-1){</span>
<span style="font-size: 16px">t = t->next;</span>
<span style="font-size: 16px">k++;</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">if(t==NULL || k!=pos-1){</span>
<span style="font-size: 16px">printf("\n插入的位置不存在！\n");</span>
<span style="font-size: 16px">return 0;</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">//如果检查的位置存在那么开始插入元素</span>
<span style="font-size: 16px">p = (listnode*)malloc(LEN);</span>
<span style="font-size: 16px">if(p==NULL){</span>
<span style="font-size: 16px">printf("\n动态开辟空间失败 Line : %d\n",__LINE__); </span>
<span style="font-size: 16px">exit(-1);</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">p->name = e;</span>
<span style="font-size: 16px">p->next = t->next;</span>
<span style="font-size: 16px">t->next = p;</span>
<span style="font-size: 16px">return 0;</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">//删除某个位置元素</span>
<span style="font-size: 16px">int delete_pos_link_list(linklist L,int pos){</span>
<span style="font-size: 16px">listnode *p;</span>
<span style="font-size: 16px">listnode *r;</span>
<span style="font-size: 16px">int i = 0;</span>
<span style="font-size: 16px">p = L;</span>
<span style="font-size: 16px">while(p!=NULL && i<pos-1){</span>
<span style="font-size: 16px">p = p->next;</span>
<span style="font-size: 16px">i++;</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">if(p->next==NULL){</span>
<span style="font-size: 16px">printf("\n删除位置不合法 Line : %d\n",__LINE__); </span>
<span style="font-size: 16px">exit(-1);</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">r = p->next;</span>
<span style="font-size: 16px">p->next = p->next->next;</span>
<span style="font-size: 16px">free(r);</span>
<span style="font-size: 16px">return 0;</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">//查找元素</span>

<span style="font-size: 16px">char find_e_link_list(linklist L,int pos){</span>
<span style="font-size: 16px">listnode *p;</span>
<span style="font-size: 16px">p = L;</span>
<span style="font-size: 16px">int i = 0;</span>
<span style="font-size: 16px">while(p!=NULL && i<pos){</span>
<span style="font-size: 16px">p = p->next;</span>
<span style="font-size: 16px">i++;</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">if(p && i==pos) return p->name;</span>
<span style="font-size: 16px">return 'n';</span>
<span style="font-size: 16px">}</span>

<span style="font-size: 16px">int main(int argc, char *argv[])</span>
<span style="font-size: 16px">{</span>
<span style="font-size: 16px">linklist L;</span>
<span style="font-size: 16px">printf("\n初始化链表\n");</span>
<span style="font-size: 16px">L = link_list_create();</span>
<span style="font-size: 16px">print_link_list(L);</span>
<span style="font-size: 16px">DataType element = 'a';</span>
<span style="font-size: 16px">insert_e_link_list(L,2,element);</span>
<span style="font-size: 16px">//插入后</span>
<span style="font-size: 16px">printf("\n插入元素后\n");</span>
<span style="font-size: 16px">print_link_list(L);</span>
<span style="font-size: 16px">printf("\n删除元素后\n");</span>
<span style="font-size: 16px">delete_pos_link_list(L,2);</span>
<span style="font-size: 16px">print_link_list(L);</span>
<span style="font-size: 16px">printf("\n查找元素\n");</span>
<span style="font-size: 16px">char find_e;</span>
<span style="font-size: 16px">if((find_e = find_e_link_list(L,10))!='n'){</span>
<span style="font-size: 16px">printf("\nfind_e = %c\n",find_e);</span>
<span style="font-size: 16px">}else{</span>
<span style="font-size: 16px">printf("\n元素没有找到\n");</span>
<span style="font-size: 16px">}</span>
<span style="font-size: 16px">if(L!=NULL) free(L);</span>
<span style="font-size: 16px">system("PAUSE"); </span>
<span style="font-size: 16px">return 0;</span>
<span style="font-size: 16px">}</span>

</div>
试试其它关键字
同语言下
可能有用的
贡献的其它代码Label