动态数组

c中的回调函数

参考链接:

https://www.cnblogs.com/jiangzhaowei/p/9129105.html

https://blog.csdn.net/qingdujun/article/details/69789300

https://www.cnblogs.com/huangzhenxiong/p/7772627.html

#include <stdio.h>
 
//返回值(*指针名)(参数列表)
typedef int (*callback)(int,int);
//回调函数
int ADD(callback p, int a, int b){
	return (*p)(a,b);//此处回调add函数...
}
//普通函数
int add(int a, int b){
	return a + b;
}
 
int main(void){
	printf("%d
",add(1,2));
	printf("%d
",ADD(add,1,2));
	return 0;
}

 动态数组

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
//接口
typedef void *myForeach(void * );
typedef int * myCompare(void * ,void * );
//动态数组结构体
struct dynamicArray
{
    void ** pAddr; //维护在堆区真实数组指针指向void*

    int m_capacity; //数组容量

    int m_size; //数组大小
};


//初始化数组
struct dynamicArray * init_DynamicArray(int capacity)
{
    if (capacity <= 0 )
    {
        return NULL;
    }

    struct dynamicArray * array = malloc(sizeof(struct dynamicArray));

    //判断内存是否申请成功
    if (array == NULL)
    {
        return  NULL;
    }

    //设置容量
    array->m_capacity = capacity;
    //设置大小
    array->m_size = 0;
    //维护在堆区数组的指针
    array->pAddr = malloc(sizeof(void*)*array->m_capacity);

    return array;
}

//插入功能
void insert_dynamicArray(struct dynamicArray * array , int pos , void * data)
{
    if (array == NULL)
    {
        return;
    }
    if (data == NULL)
    {
        return;
    }
    if (pos < 0 || pos > array->m_size)
    {
        //无效的位置  进行尾插
        pos = array->m_size;
    }

    //先判断是否已经 满载 ,如果满载了  动态开辟
    if (array->m_size >= array->m_capacity)
    {
        //1、申请一个更大的内存空间
        int newCapacity = array->m_capacity * 2;

        //2、创建新空间
        void ** newSpace = malloc(sizeof(void *)* newCapacity);

        //3、将原有数据 拷贝到新空间下
        memcpy(newSpace, array->pAddr, sizeof(void*)*array->m_capacity);

        //4、释放原有空间
        free(array->pAddr);

        //5、更改指针指向
        array->pAddr = newSpace;
        //6、更新新容量大小
        array->m_capacity = newCapacity;

    }

    //插入新数据元素
    //从最后一个位置开始 依次移动数据  后移

    for (int i = array->m_size - 1; i >= pos;i--)
    {
        array->pAddr[i + 1] = array->pAddr[i];
    }

    //将新元素插入到指定位置
    array->pAddr[pos] = data;

    //更新大小
    array->m_size++;
}


//遍历数组
void foreach_DynamicArray(struct dynamicArray * array , myForeach p)
{

    if (array == NULL)
    {
        return;
    }
    if (p == NULL)
    {
        return;
    }

    for (int i = 0; i < array->m_size;i++)
    {
        *p(array->pAddr[i]);
    }
}

//删除数组中元素  -- 按照指定位置进行删除
void removeByPos_DynamicArray(struct dynamicArray * arr, int pos)
{
    if (arr == NULL)
    {
        return;
    }
    if (pos < 0 || pos > arr->m_size-1)
    {
        //无效的位置 直接return
        return;
    }

    //从pos位置开始  到数组尾  数据进行前移
    for (int i = pos; i < arr->m_size - 1; i++)
    {
        arr->pAddr[i] = arr->pAddr[i + 1];
    }

    arr->m_size--;
}

//删除数组中的元素  --- 按照值来进行删除
void removeByValue_DynamicArray(struct dynamicArray * arr, void * data , myCompare p)
{
    if (arr == NULL)
    {
        return;
    }
    if (data == NULL)
    {
        return;
    }

    for (int i = 0; i < arr->m_size;i++)
    {
        if ((*p)(arr->pAddr[i],data))
        {
            removeByPos_DynamicArray(arr, i);
            break;
        }
    }

}

//销毁数组
void destroy_DynamicArray(struct dynamicArray * arr)
{
    if (arr==NULL)
    {
        return;
    }

    if (arr->pAddr != NULL)
    {
        free(arr->pAddr);
        arr->pAddr = NULL;
    }

    free(arr);
    arr = NULL;
}












struct Person
{
    char name[64];
    int age;
};

void myPrintPerson(void * data)
{
    struct Person * p = data;
    printf("姓名:%s 年龄%d
", p->name, p->age);
}

int myComparePerson(void * data1,void * data2)
{
    struct Person * p1 = data1;
    struct Person * p2 = data2;

    return  strcmp(p1->name, p2->name) == 0 && p1->age == p2->age;
}


void test01()
{
    //创建动态数组
    struct dynamicArray * arr = init_DynamicArray(5);

    //准备出5个person数据
    struct Person p1 = { "亚瑟", 18 };
    struct Person p2 = { "王昭君", 28 };
    struct Person p3 = { "赵云", 38 };
    struct Person p4 = { "张飞", 19 };
    struct Person p5 = { "关羽", 20 };
    struct Person p6 = { "宫本", 17 };

    //将数据插入到动态数组中

    printf("当前的容量为:%d
", arr->m_capacity);

    insert_dynamicArray(arr, 0, &p1);
    insert_dynamicArray(arr, 0, &p2);
    insert_dynamicArray(arr, 0, &p3);
    insert_dynamicArray(arr, 2, &p4);
    insert_dynamicArray(arr, 10, &p5);
    insert_dynamicArray(arr, 1, &p6);


    //  赵云  宫本  王昭君  张飞 亚瑟  关羽

    //遍历动态数组
    foreach_DynamicArray(arr, myPrintPerson);

    printf("插入数据后的容量为:%d
", arr->m_capacity);


    //删除数组中的元素
    removeByPos_DynamicArray(arr, 1);

    printf("删除第一个位置的元素后,数组中数据为:
");
    foreach_DynamicArray(arr, myPrintPerson);

    struct Person p = { "张飞", 19 };

    removeByValue_DynamicArray(arr, &p, myComparePerson);

    printf("-----------------------------------
");
    foreach_DynamicArray(arr, myPrintPerson);

    //销毁数组
    destroy_DynamicArray(arr);
    arr = NULL;

}



int main(){

    test01();

    return 0;
}

  

加油啦!加油鸭,冲鸭!!!
原文地址:https://www.cnblogs.com/clarencezzh/p/11726667.html