C语言字符串子串判断:查找子串首次出现位置并改正代码错误
#include <stdio.h> #include <stdlib.h>
int main() { char st[50], sub[30]; int i, j, k, key; printf("Enter a string:"); gets(st); printf("\nEnter a sub string: "); gets(sub); key = 0; for (i = 0; st[i] != '\0'; i++) { for (j = i, k = 0; sub[k] != '\0' && sub[k] == st[j]; j++, k++); if (sub[k] == '\0') { printf("%d", i); key = 1; break; } } if (!key) { printf("-1\n"); } system("pause"); return 0; }
原文地址: https://www.cveoy.top/t/topic/m9ML 著作权归作者所有。请勿转载和采集!