524. Longest Word in Dictionary through Deleting

Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order.
If there is no possible result, return the empty string.

Example 1:

Input:
s = "abpcplea", d = ["ale","apple","monkey","plea"]

Output:
"apple"

Example 2:

Input:
s = "abpcplea", d = ["a","b","c"]

Output:
"a"

Note:

All the strings in the input will only contain lower-case letters.
The size of the dictionary won't exceed 1,000.
The length of all the strings in the input won't exceed 1,000.
输出最大的子序列。

public class Solution {
public String findLongestWord(String s, List<String> d) {
List<String> res=new ArrayList<>();
for(String str:d){
if(s.length()<str.length()) continue;
if(find(s,str)) res.add(str);
}
res.sort(new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
if(o1.length()!=o2.length())
return o2.length()-o1.length();
else return o1.compareTo(o2);
}
});
return res.size()==0?"":res.get(0);
}
public boolean find(String s,String d){
int i=0,j=0;
while(i<s.length()&&j<d.length()){
if(s.charAt(i)==d.charAt(j)){
i++;j++;
}
else i++;
}
return j==d.length();
}
}
只保存一个字符串即可。被tag骗了--

public class Solution {
public String findLongestWord(String s, List<String> d) {
String res="";
for(String str:d){
String p;
if(s.length()<str.length()) continue;
if(find(s,str)) {
p=str;
if(p.length()>res.length()||(p.length()==res.length()&&p.compareTo(res)<0)){
res=p;
}
}
}
return res;
}
public boolean find(String s,String d){
int i=0,j=0;
while(i<s.length()&&j<d.length()){
if(s.charAt(i)==d.charAt(j)){
i++;j++;
}
else i++;
}
return j==d.length();
}
}