标签：node val temp int 单向 链表 pnode 例子 printf

单链表基础例子，实现增删改查读销，可选目标值或目标位置读、插、删，另有其他小功能如注释，未增加malloc后的检查NULL

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>

/*
链表是一个由指针指向的结构体内存序列

功能ok，实现生成指定长度链表，增删改读插销毁

*/

typedef struct Node{
    struct Node * pnext;
    int val;

} node,*pnode;

pnode gen_node(int num);//生成链表
void show_node(pnode p_f);//打印链表
void add_elem(pnode phead_f,int val_f);//在链表尾加一个元素
void change_point(int val_f, int val_d, pnode p_head_f);//改变某个元素的值
void addin(int val_f, int val_d, pnode p_head_f);//在某元素后面插入一个元素
void delete(int val_f, pnode p_head_f);//删除某个元素
void destory_node(pnode p_head_f);//销毁一个链表
void add_before(pnode p_node, int val_d, int val_f);//add one element before val_d;
int pos_to_val(pnode p_node, int pos );//input position,return value of that position,an additional api

int main(void){

    int v = 0;
    int n = 0;
    int val_f;
    int	val_d;
    pnode NODE; 
    printf("input node num:\n");
    scanf("%d",&v);
    NODE = gen_node(v);
    show_node(NODE);//生成链表
    
    
    printf("input an int to put in node\n");
    scanf("%d",&n);
    add_elem(NODE, n);
    show_node(NODE);//在尾部增加
    
    printf("input point you want to change:\n");
    scanf("%d",&val_f);
    printf("input new point value:\n");
    scanf("%d",&val_d);
    change_point(val_f,val_d,NODE);
    show_node(NODE);//更改某个链表元素

    printf("input target val to add a val next to it:\n");
    scanf("%d",&val_f);
    printf("input the val you want to addin:\n");
    scanf("%d",&val_d);
    addin(val_f, val_d, NODE);
    show_node(NODE);//在某元素后插入新元素

    printf("input the value you want to delete:\n");
    scanf("%d",&val_f);
    delete(val_f, NODE);
    show_node(NODE);
    show_node(NODE);//删除1个元素


	printf("input a target val to add before:\n");
	scanf("%d",&val_d);
	printf("input a val to add before:\n");
	scanf("%d",&val_f);
	add_before(NODE,val_d,val_f);
	show_node(NODE);


	printf("input a pos\n");
	int pos;
	scanf("%d",&pos);
	printf("%d\n",pos_to_val(NODE,  pos ));


    destory_node(NODE);//销毁链表

	return 0;
}

pnode gen_node(int num){
    int i = 0;
    int val_f = 0;
    pnode phead;
    phead = (pnode)malloc(sizeof(node));
	if(phead == NULL){
		printf("failed to creat node\n");
		return NULL;
	}
    pnode ptemp;
    ptemp = phead;
    phead->val = 0;
    for(i = 0; i<num; i++){
		pnode pnew = (pnode)malloc(sizeof(node));
		
		if(pnew == NULL){
			printf("failed to creat new list\n");
			return NULL;
		}


		printf("input an int :\n");
		scanf("%d",&val_f);

		pnew->val = val_f;
		ptemp->pnext = pnew;
		pnew->pnext = NULL;
		ptemp = pnew;
    }
    return phead;
}

void show_node(pnode p_f){
    pnode p_temp;
    p_temp = p_f->pnext;
    printf("value in node is :\n");
    while(p_temp->pnext != NULL){
		printf("%d\n",(p_temp->val));
		p_temp = p_temp->pnext; 
    }
    printf("%d\n",(p_temp->val));
}

void add_elem(pnode phead_f,int val_f){
	pnode p_temp_a;
	p_temp_a = phead_f;
	pnode pnew;
	while(p_temp_a->pnext != NULL){
	    p_temp_a = p_temp_a->pnext;
	}
	pnew = (pnode)malloc(sizeof(node));
	pnew->val = val_f;
	p_temp_a->pnext = pnew;
	pnew->pnext = NULL;
	printf("add one elem after desired val done\n");
}

void change_point(int val_f, int val_d, pnode p_head_f){
    pnode p_temp;
    p_temp = p_head_f;

    while(p_temp->val != val_f){

		p_temp = p_temp->pnext;
		if (p_temp == NULL){
			printf("wrong val.no such num\n");
return;
		}
    }
    p_temp->val = val_d;

}

void addin(int val_f, int val_d, pnode p_head_f){
    pnode p_temp;
    p_temp = p_head_f;
    pnode p_new;
    while(p_temp->val != val_f){
		p_temp = p_temp->pnext;
		if( p_temp == NULL){
	
			printf("no such value !");
			return;
		}

    }

    p_new = (pnode)malloc(sizeof(node));
    p_new->val = val_d;
    p_new->pnext = p_temp->pnext;
    p_temp->pnext = p_new;

   
}

void delete(int val_f, pnode p_head_f){
    pnode p_temp;
    pnode p_temp_p;
    p_temp = p_head_f;
    while(p_temp->val != val_f){
		p_temp_p = p_temp;
		p_temp = p_temp->pnext;	

		if( p_temp == NULL){
	
			printf("no such value !\n");
			return;
		}

		
    }
    p_temp_p->pnext = p_temp->pnext;
    free(p_temp);
}

void destory_node(pnode p_head_f){
    pnode p_temp;
    p_temp = p_head_f;
    pnode p_temp_p;
    int i = 1;
    while(p_temp->pnext != NULL){
		p_temp_p = p_temp;
		p_temp = p_temp->pnext;
		p_temp_p->val = 0;
		free(p_temp_p);
		printf("%d element destoryed\n",i);
		i++;
    }
	if(p_temp != NULL)
		free(p_temp);
    printf("last element destoryed\n"); 
}

void add_before(pnode p_node, int val_d, int val_f){
	pnode p_temp;
	pnode p_new;
	pnode p_temp_p;
	p_new = (pnode)malloc(sizeof(node));
	p_temp = p_node;
	
	while(p_temp->val != val_d){
		p_temp_p = p_temp;
		p_temp = p_temp->pnext;
		if( p_temp == NULL){
	
			printf("no such value !\n");
			return;
		}
				
	}
	p_new->val = val_f;
	p_new->pnext = p_temp;
	p_temp_p->pnext = p_new;
	printf("add one element before desired val done\n");	
}

int pos_to_val(pnode p_node, int pos ){

	pnode p_temp = p_node->pnext;
	int i = 0;
	for (i = 0; i<pos; i++){
		p_temp = p_temp->pnext;
	}
	printf("val:%d\n",p_temp->val);
	return p_temp->val;


}

标签：node,val,temp,int,单向,链表,pnode,例子,printf
来源： https://blog.csdn.net/aiiye/article/details/110140229

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。