Given an array of string words. Return all strings in words which is substring of another word in any order.
String words[i] is substring of words[j], if can be obtained removing some characters to left and/or right side of words[j].
Example 1:
Input: words = ["mass","as","hero","superhero"]
Output: ["as","hero"]
Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
["hero","as"] is also a valid answer.
Example 2:
Input: words = ["leetcode","et","code"]
Output: ["et","code"]
Explanation: "et", "code" are substring of "leetcode".
Example 3:
Input: words = ["blue","green","bu"]
Output: []
Constraints:
1 <= words.length <= 100
1 <= words[i].length <= 30
words[i] contains only lowercase English letters.
It's guaranteed that words[i] will be unique.
Solution:
class Solution {
public List<String> stringMatching(String[] words) {
Arrays.sort(words, (a, b) -> { return Integer.compare(b.length(), a.length()); });
List<String> result = new ArrayList();
for (int i = 0; i < words.length; i ++) {
String curr = words[i];
for (int j = 0; j < i; j ++) {
String prev = words[j];
if (prev.indexOf(curr) != -1) {
result.add(curr);
break;
}
}
}
return result;
}
}