public static void main(String[] args) {
/*
关联子串:
示例1:输入:str1="abc",str2="efghicabiii" 输出:5
解释:str2包含str1的一种排列组合("cab"),此组合在str2的字符串起始位置为5(从0开始计数)
示例2:str1="abc",str2="efghicaibii" 输出:-1
*/
// abc acb bac bca cab cba
String str1 = "cab";
String str2 = "efghicabiii";
if (str1.length() > str2.length()) {
System.out.println(-1);
return;
}
List<String> strList = new ArrayList<>();
permutation(str1.toCharArray(), 0, strList);
for (int i = 0; i < strList.size(); i++) {
if (str2.indexOf(strList.get(i)) != -1) {
System.out.println(str2.indexOf(strList.get(i)));
return;
}
}
System.out.println(-1);
}
private static void permutation(char[] inputStr, int begin, List<String> stringList) {
if (begin == inputStr.length) {
stringList.add(String.valueOf(inputStr));
}
for (int i = begin; i < inputStr.length; i++) {
/*将第一个字符和后面的字符依次交换*/
swap(inputStr, i, begin);
/*对于第一个字符后面的字符,依次和后面的字符进行交换*/
permutation(inputStr, begin + 1, stringList);
/*由于还要交换其他位到该位,因此要将字符串恢复到未交换的时候的样子*/
swap(inputStr, i, begin);
}
}
private static void swap(char[] inputStr, int i, int j) {
char temp = inputStr[i];
inputStr[i] = inputStr[j];
inputStr[j] = temp;
}
11-04