/*
* 算法思想:
* 用数组记录字典中每个词的长度,查询时,先比较长度,再比较首尾字母。
* 注意考虑len<=2的时候。
*
*/
typedef struct {
char ** dic;
int dsize;
int *lens;
} ValidWordAbbr;
ValidWordAbbr* validWordAbbrCreate(char ** dic, int dsize) {
ValidWordAbbr* obj = (ValidWordAbbr*)malloc(sizeof(ValidWordAbbr));
int i;
obj->dic = dic;
obj->dsize = dsize;
if(!dsize) return obj;
obj->lens = (int *)malloc(sizeof(int ) * dsize);
for(i=0; i<dsize; i++){
obj->lens[i] = strlen(dic[i]);
}
return obj;
}
bool validWordAbbrIsUnique(ValidWordAbbr* obj, char * word) {
int i, len;
if(!obj->dsize) return true;
for(i=0; i<obj->dsize; i++){
len = strlen(word);
if(len == obj->lens[i] && len<=2){
return true;
}
if(len == obj->lens[i] && word[len-1] == obj->dic[i][len-1]
&& word[0] == obj->dic[i][0] && memcmp(word, obj->dic[i], len)){
return false;
}
}
return true;
}
void validWordAbbrFree(ValidWordAbbr* obj) {
if(obj->dsize)
free(obj->lens);
free(obj);
}
/**
* Your ValidWordAbbr struct will be instantiated and called as such:
* ValidWordAbbr* obj = validWordAbbrCreate(dictionary, dictionarySize);
* bool param_1 = validWordAbbrIsUnique(obj, word);
* validWordAbbrFree(obj);
*/
leetcode-288. 单词的唯一缩写-C语言
最新推荐文章于 2022-10-15 23:47:59 发布