题目描述
Given a string s
and a string array dictionary
, return the longest string in the dictionary that can be formed by deleting some of the given string characters. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.
Example 1:
Input: s = "abpcplea", dictionary = ["ale","apple","monkey","plea"] Output: "apple"
Example 2:
Input: s = "abpcplea", dictionary = ["a","b","c"] Output: "a"
Constraints:
1 <= s.length <= 1000
1 <= dictionary.length <= 1000
1 <= dictionary[i].length <= 1000
s
anddictionary[i]
consist of lowercase English letters.
解题思路
【C++】
class Solution {
public:
string findLongestWord(string s, vector<string>& dictionary) {
string res;
for (string p : dictionary) {
int i = 0, j = 0;
while (j < s.size() && i < p.size()) {if (s[j++] == p[i]) {i++;}}
if (i < p.size()) {continue;}
if (p.size() > res.size()) res = p;
else if (p.size() == res.size()) {res = min(res, p);}
}
return res;
}
};
【Java】
class Solution {
public String findLongestWord(String s, List<String> dictionary) {
String res = "";
for(String p : dictionary) {
int pi = 0, sj = 0;
while (sj < s.length() && pi < p.length()) {
if(s.charAt(sj++) == p.charAt(pi)) {pi++;}
}
if (pi < p.length()) {continue;}
if (p.length() > res.length()
|| (p.length() == res.length() && res.compareTo(p) > 0)) {
res = p;
}
}
return res;
}
}
参考文献
【1】Java compare方法和compareTo方法_lonelyVM的博客-CSDN博客_compare java