双向循环链表

双向链表实例:

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

typedef struct node {
    int item;
    struct node *next;
    struct node *prev;
}node;

//插入
int list_insert(node **list)
{
    int ret = 0;

    node *newnode = malloc(sizeof(node));   
    memset(newnode, 0x00, sizeof(newnode));
    if ( newnode == NULL )
        ret = -1;

    if ( ret != -1 ) {
        printf("item: ");
        scanf("%d", &newnode->item);
        newnode->next = newnode->prev = NULL;

        if ( *list == NULL ) {
            *list = newnode;
            newnode->next = newnode;
            newnode->prev = newnode;
        } else {
            newnode->next = *list;
            newnode->prev = (*list)->prev;
            (*list)->prev->next = newnode;
            (*list)->prev = newnode;
        }
    }

    return ret;
}

//删除
node *list_delete(node **list, int pos)
{
    node *ret = NULL;

    if ( *list!=NULL && pos>=0 ) {
        int i;
        node *cur  = *list;
        node *prev = NULL;

        for (i=0; i<pos; i++) {
            prev = cur;
            cur = cur->next;
        }
        if ( prev == NULL ) {
            if ( cur == cur->next ) {       //只有一个节点,然后删除
                *list = NULL;
            } else if ( cur != NULL ) {     //有好多节点,然后删除第一个,
                (*list)->prev->next = cur->next;
                cur->next->prev = (*list)->prev;
                *list = cur->next;
            }
            ret = cur;
        } else {
            ret = cur;
            cur->next->prev = prev;
            prev->next = cur->next;
        }
    }
    return ret;
}
//显示
void list_display( node *list )
{
    node *cur = list;

    if ( cur != NULL ) {
        do {
            printf("%d ", cur->item);   
            cur = cur->next;
        } while ( cur != list );
    }

    return;
}

int main( void )
{
    node *list = NULL;

    list_insert(&list);
    list_insert(&list);
    list_insert(&list);
    list_insert(&list);

    while ( list != NULL ) {
        printf("%d ", list_delete(&list, 0)->item);
    }
    printf("\n");

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值