forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSubStringCheck.java
47 lines (43 loc) · 1.26 KB
/
SubStringCheck.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
package com.rampatra.strings;
/**
* Created by IntelliJ IDEA.
*
* @author rampatra
* @since 10/20/15
* @time: 1:15 PM
* @see: StringRotation for a similar problem.
*/
public class SubStringCheck {
/**
* Naive approach to determine whether string {@param s2} is a
* substring of string {@param s1}.
*
* @param s1
* @param s2
* @return
*/
public static boolean isSubString(String s1, String s2) {
char[] c1 = s1.toCharArray(),
c2 = s2.toCharArray();
int l1 = c1.length,
l2 = c2.length,
i, j;
for (i = 0; i <= l1 - l2; i++) {
for (j = 0; j < l2 && i + j < l1; j++) {
if (c1[i + j] != c2[j]) break;
}
if (j == l2) {
return true;
}
}
return false;
}
public static void main(String[] args) {
System.out.println(isSubString("rampatra", "rampatra"));
System.out.println(isSubString("rampatra", ""));
System.out.println(isSubString("rampatra", "ram"));
System.out.println(isSubString("rampatra", "rams"));
System.out.println(isSubString("rampatra", "ramss"));
System.out.println(isSubString("rampatra", "ar"));
}
}