-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathIndexOf.java
49 lines (43 loc) · 1.26 KB
/
IndexOf.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package algorithms;
import java.util.Scanner;
/**
*
* @author Gökhan DAĞTEKİN
*
* 2015
*/
public class IndexOf {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter a sentence: ");
String string1 = sc.nextLine();
System.out.println("Enter a word/sentence: ");
String string2 = sc.nextLine();
System.out.println(findIndex(string1, string2));
}
public static int findIndex(String s1, String s2) {
char[] array1 = new char[s1.length()];
char[] array2 = new char[s2.length()];
for (int i = 0; i < s1.length(); i++) {
array1[i] = s1.charAt(i);
}
for (int i = 0; i < s2.length(); i++) {
array2[i] = s2.charAt(i);
}
int counter = 0;
for (int i = 0; i < s1.length() - s2.length() + 1; i++) {
for (int j = 0; j < s2.length(); j++) {
if (array1[j + i] == array2[j]) {
counter++;
if (counter == s2.length()) {
return i;
}
} else {
counter = 0;
break;
}
}
}
return -1;
}
}