-
Notifications
You must be signed in to change notification settings - Fork 3
/
repeatSubSeq.java
50 lines (40 loc) · 1.33 KB
/
repeatSubSeq.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
50
public class repeatSubSeq {
//Given a string, find if there is any sub-sequence that repeats itself.
// A sub-sequence of a string is defined as a sequence of characters generated by deleting some characters in the string without changing the order of the remaining characters.
public int anytwo(String a) {
int n = a.length();
int T[][] = new int[n +1][n +1];
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (a.charAt(j -1) == a.charAt(i -1) && i != j)
T[i][j] = T[i -1][j -1] +1;
else
T[i][j] = Math.max(T[i-1][j], T[i][j -1]);
}
}
// for (int i = 0; i <= n; i++){
// for (int j = 0; j <= n; j++)
// System.out.print(T[i][j] + " ");
// System.out.println();
// }
return T[n][n];
}
public int numDistinct(String s, String t) {
int m = s.length(), n = t.length();
int T[][] = new int[m +1][n +1];
for (int i = 0; i <= m; i++)
T[i][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++){
if (s.charAt(i -1) == t.charAt(j -1))
T[i][j] = T[i -1][j] + T[i -1][j -1];
else
T[i][j] = T[i -1][j];
}
return T[m][n];
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(new repeatSubSeq().numDistinct("rabbbit", "rabbit"));
}
}