leetcode设计类

最新推荐文章于 2023-01-28 17:49:50 发布

luketay1234

最新推荐文章于 2023-01-28 17:49:50 发布

阅读量100

点赞数

分类专栏： leetcode学习

本文链接：https://blog.csdn.net/luketay1234/article/details/125074786

版权

搜索推荐排序算法字符串比较产品匹配内存管理

关键词由CSDN通过智能技术生成

leetcode学习专栏收录该内容

3 篇文章 0 订阅

订阅专栏

int Comp(const void *a, const void *b) 
{
    char *product1 = *(char**)a;
    char *product2 = *(char**)b;
    return strcmp(product1, product2);
}
char *** suggestedProducts(char ** products, int productsSize, char * searchWord, 
    int* returnSize, int** returnColumnSizes){
    *returnSize = 0;
    if(products == NULL || productsSize <= 0 || searchWord == NULL) {
        return NULL;
    }
    int wordLength = strlen(searchWord);
    *returnColumnSizes = (int*)calloc(wordLength, sizeof(int));
    if(*returnColumnSizes == NULL) {
        return NULL;
    }
    char ***res = (char***)calloc(wordLength, sizeof(char**));
    if(res == NULL) {
        return NULL;
    }
    for(int i = 0; i < wordLength; i++) {
        res[i] = (char**)calloc(3, sizeof(char*));
    }
    qsort(products, productsSize, sizeof(products[0]), Comp);
    for(int i = 0; i < wordLength; i++) {
        for(int j = 0; j < productsSize; j++) {
            if(strncmp(searchWord, products[j], i + 1) == 0) {
                int num = (*returnColumnSizes)[*returnSize];
                if(num >= 3) {
                    break;
                }
                res[*returnSize][num] = (char*)calloc(strlen(products[j]) + 1, sizeof(char));
                strcpy(res[*returnSize][num], products[j]);
                (*returnColumnSizes)[*returnSize]++;
            }
        }
        (*returnSize)++;
    }
    return res;
}

搜索推荐系统