字符串匹配

public class Main
{

    public static void main(String[] args)
    {
        String str1 = "abab";
        String str2 = "acsbassbba";
        int a[] = new int[26];
        int b[] = new int[str2.length()];
        int bl = 0;
        for (int i = 0; i < str1.length(); i++)
            a[str1.charAt(0) - ‘a‘] = 1;
        for (int i = 0; i < str2.length(); i++)
            if (str2.charAt(i) == str1.charAt(0))
            {
                b[bl++] = i;
            }
        int si = 1;
        for (int i? = b[0] + 1; i? < bl; i?++)
        {
            si = 1;
            for (int j = b[0] + 1; j < str2.length() && si != str1.length(); ++j)
            {
                if (str1.charAt(si) == str2.charAt(j))
                {
                    ++si;
                }
                else
                {
                    // 判断是否是str1中的字符
                    if (a[str2.charAt(j)-‘a‘] == 1)
                    {
                        // 错误的匹配
                        break;
                    }
                    // 不是j++
                }
            }
        }
        if (bl != 0 && si == str1.length()) System.out.println("ok");
        else
            System.out.println("false");
    }

}