双向循环链表，功能扩充

双向循环链表，功能扩充

双向循环链表，功能扩充

实现双链表增 删 改 查 头插 尾插 中间插 插在前面、后面、读 销毁 ，可选择按位置或按值操作，Linux下ok

更新：同时支持初始化单个头节点与初始化完整链表

/*
	doubly linked list
	disable main() when use
*/

#include <stdio.h>
#include <stdlib.h>
#define _VAL_WISE 1
#define _POS_WISE 0
#define _PFX 0
#define _BHD 1


// typedef struct Data{
// 	unsigned int UID;
// 	int intVal1;
// 	int intVal2;
// 	float fltVal;
// 	char string[50];
// 	void * ptr1;
// 	void * ptr2;

// }data,*pdata;


typedef struct Dnode{	
	struct Dnode * fwd;
	struct Dnode * bwd;
	int val;
	//data obj;
}dnode ,*pdnode;


pdnode init_dnode(int num);
//init a node with "num" parts of element

void show_dnode(pdnode p_dnode);
//printf all value forward

void apd_dnode(pdnode p_dnode, int val_f);
//add one element at tail

int srh_dnode(pdnode p_dnode, int pos);
//ger a specific position'value, pos start from 1

int pos_dnode(pdnode p_dnode ,  int val_f);
//get first val_f' position  

void inst_dnode(pdnode p_dnode, int val_f, int val_d, int method,int bora);
//insert one element to node , val_f is position or target value,chosen by method
//if method == _VAL_WISE ,val_f act as target value,if method == _POS_WISE
//val_f act as target position, position start from 1
//if bora == _BHD ,new value "val_d" will be inserted behind target value or target position
//otherwise if bora == _PFX, before

void show_IC(pdnode p_dnode);
//show all node value forward once,then backward once

void rpe_dnode(pdnode p_dnode, int val_f, int val_d, int method);
//replace node's one value,val_f and val_d and method 's usage are same as above

void del_dnode(pdnode p_dnode, int val_f, int method);
//delete node's one value,val_f and val_d and method 's usage are same as above

void dsty_dnode(pdnode p_dnode);
//free node's all memory

pdnode init_stal_dnode(void);
//init a single head , in order to meet the need of some condition,
//after initialization,use as ordinary node. 

int main(void){
	system("sudo apt-get install sl");
	system("sl");
	int num = 0;
	int val_d;
	printf("input num:\n");
	scanf("%d",&num);
	pdnode p_dnode = init_dnode(num);
	show_dnode(p_dnode);

	int val_f = 0;
	printf("input a val to append\n");
	scanf("%d",&val_f);

	apd_dnode(p_dnode, val_f);
	show_dnode(p_dnode);

	int pos = 0;
	printf("input a pos to srh\n");
	scanf("%d",&pos);
	printf("val is %d\n",srh_dnode(p_dnode, pos));


	printf("input a val to pos\n");
	scanf("%d", &val_f);
	printf("pos is %d\n",pos_dnode(p_dnode , val_f));


	printf("input val_f(pos or val) ,val_d to insert_BHD\n");
	scanf("%d%d", &val_f, &val_d);
	inst_dnode(p_dnode, val_f, val_d, _VAL_WISE, _BHD);
	show_dnode(p_dnode);
	

	printf("input val_f(pos or val) ,val_d to insert_PFX\n");
	scanf("%d%d", &val_f, &val_d);
	inst_dnode(p_dnode, val_f, val_d, _VAL_WISE, _PFX);
	show_dnode(p_dnode);
	

	printf("input val_f(pos or val) ,val_d to replace\n");
	scanf("%d%d", &val_f, &val_d);
	rpe_dnode(p_dnode, val_f,  val_d, _VAL_WISE);
	show_dnode(p_dnode);
	


	printf("input val_f(pos or val) to delete\n");
	scanf("%d", &val_f);
	del_dnode(p_dnode,val_f,_VAL_WISE);
	show_dnode(p_dnode);


	//dsty_dnode(p_dnode);

	show_IC(p_dnode);
}

pdnode init_stal_dnode(void){
	pdnode p_head;
	p_head = (pdnode)malloc(sizeof(dnode));
	p_head->fwd = p_head;
	p_head->bwd = p_head;
	p_head->val = -99999;
	return p_head;
}

pdnode init_dnode(int num){//init 
	pdnode p_head;
	p_head = (pdnode)malloc(sizeof(dnode));
	if (p_head == NULL){
		printf("out of memory when init node\n");
		return NULL;
	}

	p_head->fwd = p_head;
	p_head->bwd = p_head;
	int val_f = 0;


	pdnode p_temp = p_head;
	pdnode p_new;
	int i = 0;
	for (i = 0; i<num; i++){
		p_new = (pdnode)malloc(sizeof(dnode));
		if (p_new == NULL){
			printf("out of memory when init node\n");
			return NULL;
		}
		printf("input val to put in node\n");
		scanf("%d",&val_f);

		p_new->val = val_f;

		p_new->fwd = p_temp->fwd;
		p_new->bwd = p_temp;
		p_temp->fwd->bwd = p_new;
		p_temp->fwd = p_new;

		p_temp = p_new;
		printf("in\n");

	}

	//p_head->val = num;
	return p_head;

}

void apd_dnode(pdnode p_dnode, int val_f){//append one element
	pdnode p_temp, p_new;
	p_temp = p_dnode->bwd;
	p_new = (pdnode)malloc(sizeof(dnode));
	if (p_new == NULL){
			printf("out of memory when append node\n");
			return;	
	}


	p_new->val = val_f;

	p_new->bwd = p_temp;
	p_new->fwd = p_temp->fwd;
	p_temp->fwd->bwd = p_new;
	p_temp->fwd = p_new;



	//p_dnode->val++;
	printf("append one val done\n");
}

void inst_dnode(pdnode p_dnode, int val_f, int val_d, int method,int bora){//insert one element
	pdnode p_temp = p_dnode;
	pdnode p_new = (pdnode)malloc(sizeof(dnode));
	if (p_new == NULL){
			printf("out of memory when insert node\n");
			return;	
	}	
	if(method == _POS_WISE){
		val_f = srh_dnode(p_dnode, val_f);
		method = _VAL_WISE;
		printf("pos transf done\n");
	}

	if(method == _VAL_WISE){//1 2 3 4 5
		while(p_temp->val != val_f){
			p_temp = p_temp->fwd;
			if(p_temp == p_dnode){
				printf("no such val or pos\n");
				return;
			}
		}
		p_new->val = val_d;

		if(bora == _BHD){
			p_new->bwd = p_temp;
			p_new->fwd = p_temp->fwd;
			p_temp->fwd->bwd = p_new;
			p_temp->fwd = p_new;
		}
		else if(bora == _PFX){
			p_new->bwd = p_temp->bwd;
			p_new->fwd = p_temp;
			p_temp->bwd->fwd = p_new;
			p_temp->bwd = p_new;
		}
	}

	printf("insert one val done \n");	
}

void rpe_dnode(pdnode p_dnode, int val_f, int val_d, int method){//replace one element

	pdnode p_temp = p_dnode->fwd;
	if (method == _POS_WISE){
		val_f = srh_dnode(p_dnode,val_f);
		method = _VAL_WISE;
	}
	if (method = _VAL_WISE){
		while (p_temp->val != val_f){
			p_temp = p_temp->fwd;
			if(p_temp == p_dnode){
				printf("no such val in this node\n");
				return;
			}
		}
		p_temp->val = val_d;
	}

	printf("replace done \n");
}

int pos_dnode(pdnode p_dnode ,  int val_f){//positioning one element
	pdnode p_temp = p_dnode->fwd;
	int i = 1;
	while(p_temp->val != val_f){
		p_temp = p_temp->fwd;
		i++;
		if(p_temp == p_dnode){
			printf("no such val in this node\n");
			return -999999;
		}
	}

	return i;
}

void del_dnode(pdnode p_dnode, int val_f, int method){//delete one element
	if (method == _POS_WISE){
		val_f = srh_dnode(p_dnode,val_f);
		method = _VAL_WISE;
	}	
	pdnode p_temp = p_dnode->fwd;
	while(p_temp->val != val_f){
		p_temp = p_temp->fwd;
		if(p_temp == p_dnode){
			printf("no such val or pos\n");
			return;
		}
	}
	p_temp->bwd->fwd = p_temp->fwd;
	p_temp->fwd->bwd = p_temp->bwd;
	free(p_temp);
	printf("delete one element done \n");
}

void dsty_dnode(pdnode p_dnode){//destroy and free memory
	pdnode p_temp, p_temp_p;
	p_temp = p_dnode->fwd;
	while(p_temp != p_dnode){
		p_temp_p = p_temp;
		p_temp = p_temp->fwd;
		free(p_temp_p);
	}
	free(p_dnode);
	printf("destroy node done\n");
}

void show_dnode(pdnode p_dnode){//print all element
	int i = 0;
	pdnode p_temp = p_dnode->fwd;
	while(p_temp != p_dnode){
		printf("%d\n",p_temp->val);
		p_temp = p_temp->fwd;
	}
	printf("show node done\n");
}


int srh_dnode(pdnode p_dnode, int pos){
	int i = 0;
	pdnode p_temp = p_dnode->fwd;

	for(i = 1; i < pos; i++){
		p_temp = p_temp->fwd;
		if(p_temp == p_dnode){
			printf("pos incurrect,try smaller one\n");
			return -999999;
		}
	}
	return p_temp->val;
}

void show_IC(pdnode p_dnode){
	pdnode p_temp = p_dnode;
	while (1){
		printf("%d\n",p_temp->val);
		p_temp = p_temp->fwd;
		sleep(1);
		if(p_temp == p_dnode){
			printf("forward reach end\n");
			break;
		}
	}
	while (1){
		printf("%d\n",p_temp->val);
		p_temp = p_temp->bwd;
		sleep(1);
		if(p_temp == p_dnode){
			printf("backward reach end\n");
			break;
		}
	}
}

// void ipt_obj(pdnode p_dnode){
	

// 	char str[50];

// 	int intVal1;
// 	int intVal2;



// 	printf("start to input obj's value:\n");
// 	printf("input UID:\n");
// 	scanf("%d",&((p_dnode->obj).UID));

	


// }