单链表

slist.h

 

typedef int elem_t;

struct node_info {
        elem_t data;
        struct node_info *next;
};

struct list_info {
        struct node_info head;
        void (*add)(struct list_info *,
                elem_t data);
        void (*add_tail)(struct list_info *,
                elem_t data);
        void (*for_each)(struct list_info *,
                void (*todo)(struct node_info *));
        void (*del)(struct list_info *,
                elem_t data);
        void (*reverse)(struct list_info *);
};

void list_init(struct list_info *);
void list_destroy(struct list_info *);


slist.c

static void list_reverse(struct list_info *info)
{
        struct node_info *back = &info->head;
        struct node_info *cur = back->next;
        struct node_info *front = cur->next;

        for (; cur != &info->head; ) {
                cur->next = back;
                back = cur;
                cur = front;
                front = front->next;
        }
        cur->next = back;
}

void list_init(struct list_info *info)
{
        info->head.data = 0;
        info->head.next = &info->head;

        info->add = list_add;
        info->add_tail = list_add_tail;
        info->for_each = list_for_each;
        info->del = list_del;
        info->reverse = list_reverse;
}

void list_destroy(struct list_info *info)
{
        struct node_info *cur = info->head.next;

        for (; cur != &info->head; cur = info->head.next) {
                info->head.next = cur->next;
                free(cur);
        }
}


test.c

 


#include <stdio.h>
#include "slist.h"

#define LIST_LEN 10

static void print(struct node_info *node)
{
        printf("%d ", node->data);
}

int main()
{
        struct list_info list;
        list_init(&list);

        size_t i = 0;
        for (i = 0; i < LIST_LEN; i++) {
/*                list.add(&list, i);*/
                list.add_tail(&list, i);
        }

        list.del(&list, 0);

        list.for_each(&list, print);
        printf("\n");

        list.reverse(&list);

        list.for_each(&list, print);
        printf("\n");

        list_destroy(&list);

        return 0;
}

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值