C语言 | Leetcode C语言题解之第392题判定子序列
题目:https://i-blog.csdnimg.cn/direct/3ed11a2f31484781b584be61be474733.png
题解:
bool isSubsequence(char* s, char* t) {
int n = strlen(s), m = strlen(t);
int f;
memset(f, 0, sizeof(f));
for (int i = 0; i < 26; i++) {
f = m;
}
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (t == j + 'a')
f = i;
else
f = f;
}
}
int add = 0;
for (int i = 0; i < n; i++) {
if (f - 'a'] == m) {
return false;
}
add = f - 'a'] + 1;
}
return true;
}
免责声明:如果侵犯了您的权益,请联系站长,我们会及时删除侵权内容,谢谢合作!更多信息从访问主页:qidao123.com:ToB企服之家,中国第一个企服评测及商务社交产业平台。
页:
[1]