动态分配字符串数组指针以及排序查找

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int num;//代表多少个指针，每个指针对应一个字符串


void main1()
{
    //char *p[10] = { "1123", "1231" };

    int num;
    scanf("%d", &num);//输入num.创建一个指针数组，num个指针
    char **pp = malloc(sizeof(char *)*num);//分配指针数组
    for (int i = 0; i < num;i++)
    {
        char str[1024] = { 0 };
        scanf("%s", str);//接受输入
        pp[i] = malloc(sizeof(char)*(strlen(str) + 1));
        strcpy(pp[i], str);//拷贝

    }
    for (int i = 0; i < num;i++)
    {
        printf("%s\n", pp[i]);
    }
    system("pause");
}

void  init(char ***ppp)
{
    
    scanf("%d", &num);//输入num.创建一个指针数组，num个指针

    *ppp = malloc(sizeof(char *)*num);//分配指针数组
    for (int i = 0; i < num; i++)
    {
        char str[1024] = { 0 };
        scanf("%s", str);//接受输入
        (*ppp)[i] = malloc(sizeof(char)*(strlen(str) + 1));
        strcpy((*ppp)[i], str);//拷贝

    }
    for (int i = 0; i < num; i++)
    {
        printf("%s\n", (*ppp)[i]);
    }
}

int  binsearch(char **pp)
{
    printf("\n二分查找法");
    char searchstr[128] = { 0 };
    scanf("%s", searchstr);
    int tou = 0;
    int wei = num - 1;
    int zhong;

    int flag = -1;
    while (tou <= wei)
    {
        zhong = (tou + wei) / 2;
        if (strcmp(pp[zhong], searchstr) == 0)
        {
            printf("\n找到%p,%s", pp[zhong], pp[zhong]);
            flag = zhong;
            return flag;
            //break;
        }
        else if (strcmp(pp[zhong], searchstr) > 0)
        {
            wei = zhong - 1;
        }
        else
        {
            tou = zhong + 1;
        }
    }
    return flag;
}

void sort(char **pp)
{
    for (int i = 0; i < num - 1; i++)
    {
        for (int j = 0; j < num - 1 - i; j++)
        {
            if (strcmp(pp[j], pp[j + 1])>0)
            {
                char *temp = pp[j];
                pp[j] = pp[j + 1];
                pp[j + 1] = temp;
            }
        }
    }
    puts("排序以后");
    for (int i = 0; i < num; i++)
    {
        printf("%s\n", pp[i]);
    }
}

int  binsearchaddr(char *** ppp)
{
    int flag = -1;
    printf("\n二分查找法");
    char searchstr[128] = { 0 };
    scanf("%s", searchstr);
    int tou = 0;
    int wei = num - 1;
    int zhong;


    while (tou <= wei)
    {
        zhong = (tou + wei) / 2;
        if (strcmp(*ppp[zhong], searchstr) == 0)
        {
            printf("\n找到%p,%s", *ppp[zhong], *ppp[zhong]);
            flag = zhong;
            return flag;;

        }
        else if (strcmp(*ppp[zhong], searchstr) > 0)
        {
            wei = zhong - 1;
        }
        else
        {
            tou = zhong + 1;
        }
    }
    return flag;
}

void sortbyaddr(char **pp)
{
    char *** ppp = malloc(sizeof(char**)*num);
    for (int i = 0; i < num;i++)
    {
        ppp[i] = &pp[i];//存储数组元素的指针，元素是一个指针
    }

    for (int i = 0; i < num - 1; i++)
    {
        for (int j = 0; j < num - 1 - i; j++)
        {
            if (strcmp( *ppp[j]  , *ppp[j+1]  )>0 )
            {
                char **pptemp = ppp[j];
                ppp[j] = ppp[j + 1];
                ppp[j + 1] = pptemp;
            }
        }
    }
    printf("二级指针数组的显示层\n");
    for (int i = 0; i < num;i++)
    {
        printf("\n%s", *ppp[i]);
    }

    printf("数据层\n");
    for (int i = 0; i < num; i++)
    {
        printf("\n %s", pp[i]);
    }
    binsearchaddr(ppp);
}

void main()
{
    //char *p[10] = { "1123", "1231" };
    char **pp;
    init(&pp);
    //sort(pp);
    //binsearch(pp);
    sortbyaddr(pp);

    system("pause");
}

转载于:https://www.cnblogs.com/lhfen/p/6082481.html