leetcode524. 通过删除字母匹配到字典里最长单词

àì夳堔傛蜴生んèń 2022-09-11 08:23 110阅读 0赞

![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBA5bmy5ZWl5ZWl5LiN6KGM77yM5ZCD6aWt56ys5LiA5ZCN_size_8_color_FFFFFF_t_70_g_se_x_16]  
思路

1.  字符串匹配，暴力匹配就完事了
2.  注意匹配和不匹配的数字

int cmp (const void *a,const void *b){ 
        char *c = *(char**)a;
        char *d = *(char**)b;
        if(strlen(c) != strlen(d))
            return strlen(d)-strlen(c);
        return strcmp(c,d);
    }
    
    char * findLongestWord(char * s, char ** dictionary, int dictionarySize){ 
        int i=0;
        int j=0;
        int k=0;
        int count =0 ;
        int len = strlen(s);
        //printf("%d\n",dictionarySize);
        char **re = (char **)malloc(sizeof(char*)*dictionarySize);
        for(i = 0; i < dictionarySize; i++) { 
            char *res = (char*)malloc(sizeof(char)*1001);
            re[i] = res;
        }
        for(i = 0; i < dictionarySize; i++){ 
            k = 0;
            int len1 = strlen(dictionary[i]);
            for(j = 0; j < len1; ) { 
                while(k < len) { 
                    if(dictionary[i][j]==s[k]) { 
                        k++;
                        j++;
                    } else { 
                        k++;
                    }
                    if(j==strlen(dictionary[i])) { 
                        strcpy(re[count],dictionary[i]);
                        count++;
                        break;
                    }
                }
                if(k==len)//到头也要break
                    break;
    
            }
        }
        if(count==0)
            return "";
        qsort(re,count,sizeof(re[0]),cmp);
        return re[0];
    }

[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBA5bmy5ZWl5ZWl5LiN6KGM77yM5ZCD6aWt56ys5LiA5ZCN_size_8_color_FFFFFF_t_70_g_se_x_16]: /images/20220828/7e7c5b218ded4536b70a4ca6ec2a254b.png