-
Notifications
You must be signed in to change notification settings - Fork 2
/
LongestStringChain.java
38 lines (35 loc) · 1.09 KB
/
LongestStringChain.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
package src.java.medium.string;
import java.util.Arrays;
public class LongestStringChain {
public int longestStrChain(String[] words) {
if (words == null || words.length==0)
return 0;
Arrays.sort(words, (w1, w2) -> w1.length()-w2.length());
int[] dp = new int[words.length];
Arrays.fill(dp, 1);
int ret = 1;
for (int i=1; i<words.length; i++) {
for (int j=i-1; j>=0; j--) {
if (isPredecessor(words[j], words[i]))
dp[i] = Math.max(dp[i], dp[j]+1);
}
ret = Math.max(ret, dp[i]);
}
return ret;
}
private boolean isPredecessor(String w1, String w2) {
if (w1.length()!=w2.length()-1)
return false;
int i=0;
boolean flag = false;
for (int j=0; j<w1.length(); j++) {
if (w1.charAt(j) != w2.charAt(i++)) {
if (flag || w1.charAt(j) != w2.charAt(i++))
return false;
else
flag = true;
}
}
return true;
}
}