https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/submissions/
给定一个字符串和一个字符串字典,找到字典里面最长的字符串,该字符串可以通过删除给定字符串的某些字符来得到。如果答案不止一个,返回长度最长且字典顺序最小的字符串。如果答案不存在,则返回空字符串。
示例 1:
输入:
s = "abpcplea", d = ["ale","apple","monkey","plea"]
输出:
"apple"
示例 2:
输入:
s = "abpcplea", d = ["a","b","c"]
输出:
"a"
说明:
所有输入的字符串只包含小写字母。
字典的大小不会超过 1000。
所有输入的字符串长度不会超过 1000。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting
int stringCmp(const void *a, const void *b)
{
int deltaLen;
char *stra = *(char **)a;
char *strb = *(char **)b;
deltaLen = strlen(strb) - strlen(stra);
if (deltaLen == 0) {
return strcmp(stra, strb);
}
return deltaLen;
}
char * findLongestWord(char * s, char ** d, int dSize)
{
qsort(d, dSize, sizeof(char *), stringCmp);
char chc;
char chs;
int i;
for (i = 0; i < dSize; i++) {
int j = 0;
int k = 0;
while ((chc = d[i][j]) && (chs = s[k])) {
if (chc == chs) {
j++;
}
k++;
}
if (chc == 0) {
break;
}
}
if (i == dSize) {
return "";
}
return d[i];
}