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.
Subscribe to see which companies asked this question.
Solution:
Tips: just record the max length and its result. when the max length is equal with last one, then compare the result, then take the small one.
Java Code:
public class Solution {
public String findLongestWord(String s, List<String> d) {
if (null == d || d.isEmpty()) {
return "";
}
String result = "";
int maxLen = 0;
for (String str : d) {
if (str.length() > s.length()) {
continue;
}
int i = 0, j = 0;
while (i < s.length() && j < str.length()) {
if (s.charAt(i) == str.charAt(j)) {
j++;
}
i++;
}
if (j == str.length() && j >= maxLen) {
if (result.isEmpty()) {
result = str;
maxLen = j;
continue;
}
result = (j > maxLen || result.compareTo(str) > 0) ? str : result;
maxLen = j;
}
}
return result;
}
}