[数据结构与算法]#力扣LeetCode1408. 数组中的字符串匹配 @FDDLC

题目描述：

1408. 数组中的字符串匹配 - 力扣（LeetCode） (leetcode-cn.com)

自测用例：

["mass","as","hero","superhero"]
["leetcode","et","code"]
["blue","green","bu"]
["abc","ab","a"]

Java代码：

class Solution {
    public List<String> stringMatching(String[] a) {
        HashSet<String> set=new HashSet<>();
        Arrays.sort(a,(p,q)->p.length()-q.length());
        for(int i=0,j;i<a.length;i++){
            for(j=i+1;j<a.length;j++)if(a[i].length()<a[j].length())break;
            for(;j<a.length;j++)if(a[j].contains(a[i]))set.add(a[i]);
        }
        return new ArrayList<>(set);
    }
}