数据结构简单模式匹配C语言

#include <iostream>
using namespace std;
int simpleMatch(char S[], int lengths, char T[], int lengtht) {
    int i = 1;
    int j = 1;
    while(i <= lengths && j <= lengtht) {
        if(S[i-1] == T[j-1]) {
            i ++;
            j ++;
        }
        else {
            i = i - j + 2;
            j = 1;
        }
    }
    if(j > lengtht) return i - j + 1;
    // if(j > lengtht) return i - lengtht; 是一个意思的
    else return -1;
}
int main() {
    int res = simpleMatch("abababcdab", 10, "babcd", 5);
    cout << res << endl;
    return 0;
}