mirror of
https://github.com/Estom/notes.git
synced 2026-02-03 10:33:35 +08:00
28 lines
739 B
Markdown
28 lines
739 B
Markdown
给你一个字符串 s 和一个字符串数组 dictionary 作为字典，找出并返回字典中最长的字符串，该字符串可以通过删除 s 中的某些字符得到。
|
||
|
||
如果答案不止一个，返回长度最长且字典序最小的字符串。如果答案不存在，则返回空字符串。
|
||
|
||
示例 1：
|
||
|
||
输入：s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]
|
||
输出："apple"
|
||
示例 2：
|
||
|
||
输入：s = "abpcplea", dictionary = ["a","b","c"]
|
||
输出："a"
|
||
|
||
提示：
|
||
|
||
1 <= s.length <= 1000
|
||
1 <= dictionary.length <= 1000
|
||
1 <= dictionary[i].length <= 1000
|
||
s 和 dictionary[i] 仅由小写英文字母组成
|
||
|
||
|
||
|
||
class Solution {
|
||
public String findLongestWord(String s, List<String> dictionary) {
|
||
|
||
}
|
||
}
|