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.
思路:
给一个字符串和一个字典,找出字符串删除字符后符合字典的最长子串,如果有多个就返回字典序最靠前的
str1.compareTo(str2)返回字典序,str1字典序在前的返回-1,str1字典序在后返回1
class Solution {
public String findLongestWord(String s, List<String> d) {
String longest = "";
for (String str : d) {
int i = 0;
for (char c : s.toCharArray()) {
if (i < str.length() && str.charAt(i) == c) {
i++;
}
}
if (i == str.length() && str.length() >= longest.length()) {
if (str.length() > longest.length() || str.compareTo(longest) < 0) {
longest = str;
}
}
}
return longest;
}
}