需求:给定两个字符串,判断长字符串中是否包含有短字符串,假如包含,输出短字符串在长字符串中的起始位置。
附上调用上述函数的代码:
下面代码是JDK中java.lang.String类中 int indexOf(String str) 字符串匹配函数的代码。
/**
* Code shared by String and StringBuffer to do searches. The
* source is the character array being searched, and the target
* is the string being searched for.
*
* @param source the characters being searched.
* @param sourceOffset offset of the source string.
* @param sourceCount count of the source string.
* @param target the characters being searched for.
* @param targetOffset offset of the target string.
* @param targetCount count of the target string.
* @param fromIndex the index to begin searching from.
*/
static int indexOf(char[] source, int sourceOffset, int sourceCount,
char[] target, int targetOffset, int targetCount,
int fromIndex) {
if (fromIndex >= sourceCount) {
return (targetCount == 0 ? sourceCount : -1);
}
if (fromIndex < 0) {
fromIndex = 0;
}
if (targetCount == 0) {
return fromIndex;
}
char first = target[targetOffset];
int max = sourceOffset + (sourceCount - targetCount);
for (int i = sourceOffset + fromIndex; i <= max; i++) {
/* Look for first character. */
if (source[i] != first) {
while (++i <= max && source[i] != first);
}
/* Found first character, now look at the rest of v2 */
if (i <= max) {
int j = i + 1;
int end = j + targetCount - 1;
for (int k = targetOffset + 1; j < end && source[j]
== target[k]; j++, k++);
if (j == end) {
/* Found whole string. */
return i - sourceOffset;
}
}
}
return -1;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
String str = in.nextLine();
String subStr = in.nextLine();
char[] source = str.toCharArray();
int sourceOffset = 0;
int sourceCount = str.length();
char[] target = subStr.toCharArray();
int targetOffset = 0;
int targetCount = subStr.length();
int fromIndex = 0;
int result = indexOf(source, sourceOffset, sourceCount,
target, targetOffset, targetCount,
fromIndex);
if (result < 0) {
System.out.println("长字符串不包含短字符串!");
} else {
System.out.println("长字符串中包含有短字符串!");
}
}
}