算法题---查找字符串是否含有子串

    boolean searchChild(String str1, String str2) {
        int count = str1.length() - str2.length();
        for (int i = 0; i < count; i++) {
            boolean has = true;
            for (int j = 0; j < str2.length(); j++) {
                if (str2.charAt(j) != str1.charAt(i + j)) {
                    has = false;
                }
            }
            if (has) {
                return true;
            }
        }
        return false;
    }