双向链表

一、链表节点类型

typedef struct stu
{
    int id;
    char name[32];
    int score;
}DataType;

typedef struct dnode
{
    DataType data;
    struct dnode *ppre;
    struct dnode *pnext;
}DLink_Node_t;

typedef struct dlink
{
    DLink_Node_t *phead;
    int clen;
    pthread_mutex_t mutex;
}DLink_t;

二、单向链表的基本操作

1.创建

DLink_t *create_doulink()
{
    DLink_t *pdoulink = (DLink_t *)malloc(sizeof(DLink_t));
    if(NULL == pdoulink)
    {
        perror("malloc fail");
        return NULL;
    }
    pdoulink->phead = NULL;
    pdoulink->clen = 0;
    pthread_mutex_init(&(pdoulink->mutex), NULL);

    return pdoulink;
}

2.头插

int push_doulink_head(DLink_t *pdoulink, DataType data)
{
    DLink_Node_t *pnode = (DLink_Node_t *)malloc(sizeof(DLink_Node_t));
    if(NULL == pnode)
    {
        perror("malloc fail");
        return -1;
    }
    pnode->data = data;
    pnode->ppre = NULL;
    pnode->pnext = NULL;

    if(is_empty_doulink(pdoulink))
    {
        pdoulink->phead = pnode;
    }
    else
    {
        pnode->pnext = pdoulink->phead;
        pdoulink->phead->ppre = pnode;
        pdoulink->phead = pnode;
    }
    pdoulink->clen++;

    return 0;
}

3.遍历

void doulink_for_each(DLink_t *pdoulink, int dir)
{
    if(is_empty_doulink(pdoulink))
        return;

    DLink_Node_t *pnode = pdoulink->phead;
    if(dir)
    {
        while(pnode != NULL)
        {
            printf("id:%d   ", pnode->data.id);
            printf("score:%d  ", pnode->data.score);
            printf("name:%s\n", pnode->data.name);
            pnode = pnode->pnext;
        }
    }
    else
    {
        while(pnode->pnext != NULL)
        {
            pnode = pnode->pnext;
        }
        while(pnode != NULL)
        {
            printf("id:%d   ", pnode->data.id);
            printf("score:%d  ", pnode->data.score);
            printf("name:%s\n", pnode->data.name);
            pnode = pnode->ppre;
        }
    }
    print

4.判空

int is_empty_doulink(DLink_t *pdoulink)
{
    return NULL == pdoulink->phead;
}

5.尾插

int push_doulink_tail(DLink_t *pdoulink, DataType data)
{
    DLink_Node_t *pnode = (DLink_Node_t *)malloc(sizeof(DLink_Node_t));
    if(NULL == pnode)
    {
        perror("malloc fail");
        return -1;
    }
    pnode->data = data;
    pnode->ppre = NULL;
    pnode->pnext = NULL;
    
    if(is_empty_doulink(pdoulink))
    {
        pdoulink->phead = pnode;
    }
    else
    {
        DLink_Node_t *p = pdoulink->phead;
        while(p->pnext != NULL)
        {
            p = p->pnext;
        }
        p->pnext = pnode;
        pnode->ppre = p;
    }
    pdoulink->clen++;

    return 0;
}

6.头删

int pop_doulink_head(DLink_t *pdoulink)
{
    if(is_empty_doulink(pdoulink)) 
    {
        return 0;
    }
    DLink_Node_t *pdel = pdoulink->phead;
    pdoulink->phead = pdoulink->phead->pnext;
    free(pdel);
    if(pdoulink->phead != NULL)
    {
    pdoulink->phead->ppre = NULL;
    }
    pdoulink->clen--;

    return 1;
}

7.尾删

int pop_doulink_tail(DLink_t *pdoulink)
{
	if (is_empty_doulink(pdoulink))
		return 0;

	DLink_Node_t *pdel = pdoulink->phead;
	while (pdel->pnext != NULL)
	{
		pdel = pdel->pnext;
	}
	
	if (pdel->ppre != NULL)
	{
		pdel->ppre->pnext = NULL;
	}
	else
	{
		pdoulink->phead = NULL;
	}
	free(pdel);
	pdoulink->clen--;
	
	return 1;
}

8.查找

DLink_Node_t *find_doulink(DLink_t *pdoulink, char *name)
{
	if (is_empty_doulink(pdoulink))
		return NULL;
	
	DLink_Node_t *pnode = pdoulink->phead;
	while (pnode != NULL)
	{
		if (!strcmp(name, pnode->data.name))
		{
			return pnode;
		}
		pnode = pnode->pnext;
	}

	return NULL;
}

9.修改

int change_doulink(DLink_t *pdoulink, char *name, int score)
{
	DLink_Node_t *pnode = find_doulink(pdoulink, name);
	if (NULL != pnode)
	{
		pnode->data.score = score;
		return 0;
	}
	
	return -1;
}

10.销毁

void destroy_doulink(DLink_t *pdoulink)
{
	while (!is_empty_doulink(pdoulink))
	{
		pop_doulink_head(pdoulink);
	}
	free(pdoulink);
}

练习：删除指定节点

int pop_point_node(DLink_t *pdoulink, char *name)
{
	if (is_empty_doulink(pdoulink))
		return 0;
	
	DLink_Node_t *pdel = find_doulink(pdoulink, name);
	if (NULL == pdel)
	{
		return 0;
	}
	if (NULL == pdel->ppre)
	{
		pop_doulink_head(pdoulink);
	}
	else if (NULL == pdel->pnext)
	{
		pop_doulink_tail(pdoulink);
	}
	else
	{
		pdel->ppre->pnext = pdel->pnext;
		pdel->pnext->ppre = pdel->ppre;
		free(pdel);
		pdoulink->clen--;
	}

	return 1;
}