今日任務(wù)：
?思維導(dǎo)圖：
實(shí)現(xiàn) 代碼：（多文件）
head.h
#ifndef __HEAD_H__
#define __HEAD_H__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef int datatype;
typedef struct Linklist
{
union {
int len;
datatype data;
};
struct Linklist* next;
}Node,*NodeP;
NodeP head_create();
NodeP create();
int output(NodeP head);
int tail_insert(NodeP head,datatype data);
int head_insert(NodeP head,datatype data);
int tail_delete(NodeP head);
int head_delete(NodeP head);
int pos_insert(NodeP head,datatype data,int pos);
int pos_delete(NodeP head,int pos);
int pos_update(NodeP head,datatype data,int pos);
int value_index(NodeP head,datatype data);
int value_delete(NodeP head,datatype data);
int inversion(NodeP head);
int free_linklist(NodeP head);
#endif
fun.c
#include "head.h"
/*
* function: 傳參 空指針判定
* @param [ in]
* @param [out]
* @return
*/
int void_point(NodeP p){
if(NULL==p){
puts("how dare you give me null point.");
return -1;
}
return 0;
}
/*
* function: 頭結(jié)點(diǎn)創(chuàng)建
* @param [ in]
* @param [out]
* @return
*/
NodeP head_create(){
NodeP head=(NodeP)malloc(sizeof(Node));
if(head==NULL){
puts("how dare you give me null place.");
return NULL;
}
head->len=0;
head->next=NULL;
return head;
}
/*
* function: 節(jié)點(diǎn)創(chuàng)建
* @param [ in]
* @param [out]
* @return
*/
NodeP create(datatype data){
NodeP new=(NodeP)malloc(sizeof(Node));
if(new==NULL){
puts("how dare you give me null place.");
return NULL;
}
new->data=data;
new->next=NULL;
return new;
}
/*
* function: 輸出
* @param [ in]
* @param [out]
* @return
*/
int output(NodeP head){
if(void_point(head))
return -1;
while(head->next!=NULL){
printf("%d\t",head->next->data);
head=head->next;
}
puts("output done.");
}
/*
* function: 節(jié)點(diǎn)尾插
* @param [ in]
* @param [out]
* @return
*/
int tail_insert(NodeP head,datatype data){
if(void_point(head))
return -1;
//找到尾部節(jié)點(diǎn)
NodeP p=head;
while(p->next!=NULL)
p=p->next;
p->next=create(data);
head->len++;
puts("tail insert success.");
return 0;
}
/*
* function: 節(jié)點(diǎn)頭插
* @param [ in]
* @param [out]
* @return
*/
int head_insert(NodeP head,datatype data){
if(void_point(head))
return -1;
NodeP new=create(data);
new->next=head->next;
head->next=new;
head->len++;
puts("head insert success");
}
/*
* function: 尾刪
* @param [ in]
* @param [out]
* @return
*/
int tail_delete(NodeP head){
if(void_point(head))
return -1;
if(head->next==NULL){
puts("there is no assigment to delete.");
return -1;
}
//找到最后一個(gè)節(jié)點(diǎn)，free并len--，前一節(jié)點(diǎn)指向null
NodeP p=head;
while(p->next->next!=NULL)
p=p->next;
free(p->next);
p->next=NULL;
head->len--;
puts("tail delete success");
return 0;
}
/*
* function: 頭刪
* @param [ in]
* @param [out]
* @return
*/
int head_delete(NodeP head){
if(void_point(head))
return -1;
if(head->next==NULL){
puts("there is no assigment to delete.");
return -1;
}
NodeP p=head->next;
free(head->next);
head->next=p->next;
p=NULL;
head->len--;
puts("head delete success");
return 0;
}
/*
* function: 指定位置添加
* @param [ in]
* @param [out]
* @return
*/
int pos_insert(NodeP head,datatype data,int pos){
if(void_point(head))
return -1;
if(pos>head->len+1||pos<1){
puts("your position is illegal.");
return -1;
}
NodeP p=head;
while(pos--!=1)
p=p->next;
NodeP new=create(data);
new->next=p->next;
p->next=new;
head->len++;
puts("pos insert success");
}
/*
* function: 指定位置刪除
* @param [ in]
* @param [out]
* @return
*/
int pos_delete(NodeP head,int pos){
if(void_point(head))
return -1;
if(pos<1||pos>head->len){
puts("your position is illegal.");
return -1;
}
NodeP p=head;
while(pos--!=1)
p=p->next;
NodeP x=p->next;
p->next=p->next->next;
free(x);
x=NULL;
head->len--;
puts("pos delete success");
return 0;
}
/*
* function: 指定位置修改
* @param [ in]
* @param [out]
* @return
*/
int pos_update(NodeP head,datatype data,int pos){
if(void_point(head))
return -1;
if(pos<1||pos>head->len){
puts("your position is illegal.");
return -1;
}
NodeP p=head;
while(pos--)
p=p->next;
p->data=data;
puts("pos update success");
return 0;
}
/*
* function: 按值查找下表
* @param [ in]
* @param [out]
* @return
*/
int value_index(NodeP head,datatype data){
if(void_point(head))
return -1;
if(head->len==0){
puts("linklist is null");
return -1;
}
int index=0;
NodeP p=head;
while(p->next!=NULL){
p=p->next;
index++;
if(p->data==data){
printf("the index your want to find is%d\n",index);
return index;
}
}
puts("can't find your value");
return 0;
}
/*
* function: 按值刪除
* @param [ in]
* @param [out]
* @return
*/
int value_delete(NodeP head,datatype data){
if(void_point(head))
return -1;
if(head->len==0){
puts("linklist is null");
return -1;
}
NodeP p=head;
while(p->next!=NULL){
if(p->next->data==data){
pos_delete(head,value_index(head,data));
puts("value delete success");
return 0;
}
p=p->next;
}
puts("no value your want to delete");
}
/*
* function: 循環(huán)逆置
* @param [ in]
* @param [out]
* @return
*/
int inversion(NodeP head){
if(void_point(head))
return -1;
if(head->len==0){
puts("linklist is NULL");
return -1;
}
if(head->len==1){
puts("there is no deed");
return 0;
}
//逆置
//將第二個(gè)節(jié)點(diǎn)作為尾節(jié)點(diǎn),但是得先記錄一下，還得用于每次循環(huán)的頭插的第一個(gè)元素
NodeP p=head->next->next;
head->next->next=NULL;
//定義一個(gè)節(jié)點(diǎn),用于方便循環(huán)調(diào)用后面的元素頭插,
NodeP k=p;
puts("debug..");
output(p);
while(p!=NULL){
p=p->next;
k->next=head->next;
head->next=k;
k=p;
}
puts("inversion success.");
return 0;
}
/*
* function: 釋放鏈表
* @param [ in]
* @param [out]
* @return
*/
int free_linklist(NodeP head){
if(void_point(head))
return -1;
NodeP p=NULL;
while(head!=NULL){
p=head;
head=head->next;
free(p);
p=NULL;
}
puts("free success.");
return 0;
}
main.c文章來源：http://www.zghlxwxcb.cn/news/detail-682377.html
#include "head.h"
int main(int argc, const char *argv[])
{
NodeP p=head_create();
tail_insert(p,10);
tail_insert(p,20);
tail_insert(p,30);
tail_insert(p,40);
tail_insert(p,50);
head_insert(p,99);
head_insert(p,88);
output(p);
//pos_insert(p,66,0);
//output(p);
//pos_delete(p,8);
//output(p);
//pos_update(p,66,8);
//output(p);
//tail_delete(p);
//output(p);
//head_delete(p);
//output(p);
//value_delete(p,77);
//output(p);
//inversion(p);
//output(p);
free_linklist(p);
p=NULL;
return 0;
}
不好，眼花了，沒看到實(shí)現(xiàn)單項(xiàng)循環(huán)鏈表，ji文章來源地址http://www.zghlxwxcb.cn/news/detail-682377.html
到了這里，關(guān)于數(shù)據(jù)結(jié)構(gòu)day05（單鏈表）的文章就介紹完了。如果您還想了解更多內(nèi)容，請?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
