中間因?yàn)橹羔樀倪\(yùn)用錯(cuò)誤 而導(dǎo)致一系列問題 指針還需要在實(shí)戰(zhàn)中加強(qiáng)理解
# ifndef dList
# define dList
/************************************************************************/
/* 實(shí)現(xiàn)雙向鏈表 用結(jié)構(gòu)來實(shí)現(xiàn)
*/
# define ENDSYMBOL -1
//DListNode * head = NULL;
typedef struct _DListNode
{
struct _DListNode* pre;
struct _DListNode* next;
int data;
}DListNode;
int DListSize;
/*bool dList_malloc(int n)
{
return (malloc(sizeof(DListNode)*n)!=NULL);
}*/
void dlist_init(DListNode *& head)
{
//DListNode tail;//其他的沒細(xì)看，你的DListNode tail;這里的tail是局部變量應(yīng)該不行，函數(shù)返回后就成了野指針了。
DListNode *tail = (struct _DListNode*)malloc(sizeof(struct _DListNode));
//*head = (struct _DListNode*)malloc(sizeof(struct _DListNode));
(head)->next = tail;
(head)->pre = NULL;
tail->pre = head;
tail->next = NULL;
DListSize = 1;
}
void dList_insert(int a,DListNode *& head)
{
struct _DListNode* node;
node = (struct _DListNode*)malloc(sizeof(struct _DListNode));
node ->data = a;
node ->next = NULL;
node ->pre = NULL;
if(DListSize == 1)//if(*head == NULL)
{
//struct _DListNode* temp;
// temp = struct _DListNode*malloc(sizeof(struct _DListNode));
// *head = node;
// (*head) ->pre = NULL;
// (*head) ->next = NULL;
(head)->data = a;
DListSize ++;
}
else if(DListSize == 2)
{
(head)->next->data = a;
DListSize ++;
}
else
{
struct _DListNode* temp;
node = (struct _DListNode*)malloc(sizeof(struct _DListNode));
temp = head;
while(temp->data < a && temp->next!=NULL)
temp=temp->next;
/*node->next = temp->next;
temp->next->pre = node;
node->pre = temp;
temp->next = node;*/
node->next = temp->next;
if((temp)->next )
temp->next->pre = node;
node->pre = temp;
temp->next = node;
node->data = a;//之前沒有加這個(gè) 代碼運(yùn)行結(jié)果有誤 但是我之前已經(jīng)賦值了
DListSize ++;
}
}
bool dList_delete(int index, DListNode *& head)
{
if(index <=0 || index > DListSize)
return false;
DListNode *temp;
int i ;
temp = head;
if(index == 1)
{
head->next->pre = NULL;
head = head->next;
free(temp);
temp = NULL;
}
else
{
for(i = 1; i < index ; i ++)
temp = temp->next;
temp->next->pre = temp->pre;
temp->pre->next = temp->next;
}
return true;
}
void dList_print(DListNode *& head)
{
DListNode * node = (head);
while(node!=NULL)
{
printf("%d\t",node->data);
node = node->next;
}
}
# endif
posted on 2010-08-03 23:30
付翔 閱讀(231)
評論(0) 編輯 收藏 引用 所屬分類:
linux 及 c相關(guān)