• ㊗️
• 大家
• offer
• 多多！

## Problem

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 and dictionary[i] consist of lowercase English letters.

## Code

class Solution {
public String findLongestWord(String s, List<String> dictionary) {
String res = "";

for (String word : dictionary) {
int i = 0;
for (char c : s.toCharArray()) {
if(i == word.length()) break;

if (c == word.charAt(i)) i++;
}

if (i == word.length()) {
if(word.length() > res.length()){
res = word;
} else if(word.length() == res.length()) {
if(word.compareTo(res) < 0) {
res = word;
}
}
}

}

return res;
}
}