我正在研究双重链表。计算出 .h 和 .c 文件。
//.h -file
typedef struct Data_t{
int d_sz;
void * data;
}data_t, * data_ptr_t;
typedef struct List_t{
int index;
struct List_t * next;
struct List_t * prev;
data_t * d;
}list_t, * list_ptr_t;
// .c 文件
/**
* Inserts a new element containing 'data' in 'list' at position 'index' and returns a pointer to the new list.
* If 'index' is 0 or negative, the element is inserted at the start of 'list'.
* If 'index' is bigger than the number of elements in 'list', the element is inserted at the end of 'list'.
*/
list_ptr_t list_insert_at_index( list_ptr_t list, data_ptr_t data, int index){
// add data to newlist
return newlist;
}
// 。主要的
int i;
int value;
data_ptr_t h;
list_ptr_t l;
printf("Enter a value:");
scanf("%d",&value);
l = list_insert_at_index( ? , ?, 0);
// 如何让函数工作?这个功能到底是什么?只能是这个功能。