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.
思路: 这题每个word跟s对比一遍肯定是少不了的,所以O(NK), n是s的length。比较两个word是不是subsequence,双指针即可;
class Solution {
public String findLongestWord(String s, List<String> d) {
String res = "";
for(String word: d) {
if(isSubsequence(s, word)) {
if(word.length() > res.length()) {
res = word;
}
if(word.length() == res.length() && word.compareTo(res) < 0) {
res = word;
}
}
}
return res;
}
private boolean isSubsequence(String s, String w) {
int i = 0; int j = 0;
char[] ss = s.toCharArray();
char[] ww = w.toCharArray();
while(i < ss.length && j < ww.length) {
if(ss[i] == ww[j]) {
i++;
j++;
} else {
i++;
}
}
return j == ww.length;
}
}