数据结构-最简单的BF算法 （C语言代码）

注意一下最开始就匹配和没有匹配的区分即可。

#include<stdio.h>

int main()

{

    char s[100], t[100];

    int pos = 0, i, flag, index;

    while (scanf("%s %s", s, t) == 2)

    {

        for (i = 0; s[i] != 0; i++)

        {

            flag = 1;

            index = i;

            pos = -1;

            for (int j = 0; t[j] != 0 && s[index] != 0;)

            {

                printf("%c", s[index]);

                if (s[index] != t[j])

                {

                    flag = 0;

                    break;

                }

                index++;

                j++;

            }

            if (flag)

            {

                pos = i;

                break;

            }

            }

            printf("\n%d\n", pos == -1 ? 0 : pos + 1);

        }

        return 0;

}