zoukankan      html  css  js  c++  java
  • 链表-----待整理

    //参考:  http://blog.csdn.net/feixiaoxing/article/details/6849457
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    #include <assert.h>
    
    
    typedef enum{
        FALSE = 0,
        TRUE = 1,
    }STATUS;
    
    // 1. 定义双向链表的基本结构
    typedef struct _DOUBLE_LINK_NODE
    {
        int data;
        struct _DOUBLE_LINK_NODE* prev;
        struct _DOUBLE_LINK_NODE* next;
    }DOUBLE_LINK_NODE, *PDoubleLinkNode;
    
    // 2. 创建双向链表节点
    DOUBLE_LINK_NODE* create_double_link_node(int value)
    {
        DOUBLE_LINK_NODE* pDLinkNode = NULL;
        pDLinkNode = (DOUBLE_LINK_NODE*)malloc(sizeof(DOUBLE_LINK_NODE));
        assert(NULL != pDLinkNode);
    
        memset(pDLinkNode, 0, sizeof(DOUBLE_LINK_NODE));
        pDLinkNode->data = value;
        return pDLinkNode;
    }
    
    // 3. 删除双向链表
    void delete_all_double_link_node(DOUBLE_LINK_NODE** pDLinkNode)
    {
        DOUBLE_LINK_NODE* pNode;
        if (NULL == *pDLinkNode)
            return;
    
        pNode = *pDLinkNode;
        *pDLinkNode = pNode->next;
        free(pNode);
        delete_all_double_link_node(pDLinkNode);
    }
    
    // 4. 在双向链表中查找数据
    DOUBLE_LINK_NODE* find_data_in_double_link(const DOUBLE_LINK_NODE* pDLinkNode, int data)
    {
        DOUBLE_LINK_NODE* pNode = NULL;
        if (NULL == pDLinkNode)
            return NULL;
    
        pNode = (DOUBLE_LINK_NODE*)pDLinkNode;
        while (NULL != pNode){
            if (data == pNode->data)
                return pNode;
            pNode = pNode->next;
        }
    
        return NULL;
    }
    
    // 5. 双向链表中插入数据
    STATUS insert_data_into_double_link(DOUBLE_LINK_NODE** ppDLinkNode, int data)
    {
        DOUBLE_LINK_NODE* pNode;
        DOUBLE_LINK_NODE* pIndex;
    
        if (NULL == ppDLinkNode)
            return FALSE;
    
        if (NULL == *ppDLinkNode){
            pNode = create_double_link_node(data);
            assert(NULL != pNode);
            *ppDLinkNode = pNode;
            (*ppDLinkNode)->prev = (*ppDLinkNode)->next = NULL;
            return TRUE;
        }
    
        if (NULL != find_data_in_double_link(*ppDLinkNode, data))
            return FALSE;
    
        pNode = create_double_link_node(data);
        assert(NULL != pNode);
    
        pIndex = *ppDLinkNode;
        while (NULL != pIndex->next)
            pIndex = pIndex->next;
    
        pNode->prev = pIndex;
        pNode->next = pIndex->next;
        pIndex->next = pNode;
        return TRUE;
    }
    
    // 6. 双向链表中删除数据
    STATUS delete_data_from_double_link(DOUBLE_LINK_NODE** ppDLinkNode, int data)
    {
        DOUBLE_LINK_NODE* pNode;
        if (NULL == ppDLinkNode || NULL == *ppDLinkNode)
            return FALSE;
    
        pNode = find_data_in_double_link(*ppDLinkNode, data);
        if (NULL == pNode)
            return FALSE;
    
        if (pNode == *ppDLinkNode){
            if (NULL == (*ppDLinkNode)->next){
                *ppDLinkNode = NULL;
            }
            else{
                *ppDLinkNode = pNode->next;
                (*ppDLinkNode)->prev = NULL;
            }
    
        }
        else{
            if (pNode->next)
                pNode->next->prev = pNode->prev;
            pNode->prev->next = pNode->next;
        }
    
        free(pNode);
        return TRUE;
    }
    
    // 7. 统计双向链表中数据的个数
    int count_number_in_double_link(const DOUBLE_LINK_NODE* pDLinkNode)
    {
        int count = 0;
        DOUBLE_LINK_NODE* pNode = (DOUBLE_LINK_NODE*)pDLinkNode;
    
        while (NULL != pNode){
            count++;
            pNode = pNode->next;
        }
        return count;
    }
    
    // 8. 打印双向链表中数据
    void print_double_link_node(const DOUBLE_LINK_NODE* pDLinkNode)
    {
        DOUBLE_LINK_NODE* pNode = (DOUBLE_LINK_NODE*)pDLinkNode;
    
        while (NULL != pNode){
            printf("%d
    ", pNode->data);
            pNode = pNode->next;
        }
    }
    
    int main()
    {
        PDoubleLinkNode Glist;
    
        Glist = create_double_link_node(66);
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,77));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,88));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,99));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,55));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,44));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,77));
        printf("insert = %d
    ",insert_data_into_double_link(&Glist,33));
        printf("len = %d
    ",count_number_in_double_link(Glist));
        print_double_link_node(Glist);
        //printf("count = %d
    ", insert_data_into_double_link(*datlinklist, 33));
        //printf("count = %d
    ", count_number_in_double_link(datlinklist));
        //count_number_in_double_link(datalinklist);
        //printf("hello world!
    ");
        return 0;
    }
  • 相关阅读:
    Runloop详解
    iOS高效裁剪图片圆角算法
    Runtime详解(下)
    Runtime详解(上)
    iOS UITextfield只允许输入数字和字母,长度限制
    iOS多线程(上)——GCD详解(上)
    @property、@sythesize以及Ivar和@dynamic讲解(下)
    iOS 循环引用讲解(中)
    @property详解,@property修饰符以及各个修饰符区别(上)
    PHP 使用 OSS 批量上传图片
  • 原文地址:https://www.cnblogs.com/mrsandstorm/p/5775917.html
Copyright © 2011-2022 走看看