Leetcode 524. Longest Word in Dictionary through Deleting

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了Leetcode 524. Longest Word in Dictionary through Deleting，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1208字，纯文字阅读大概需要2分钟。

内容图文

Description: 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.

Link: 524. Longest Word in Dictionary through Deleting

Examples:

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.

思路: 返回最长的在字典中的单词，如果长度相同，按字母顺序最小的。所以先对字典中的单词排序，长度由大到小，字母顺序由小到大，然后遍历字典，是否单词是s的子串。

class Solution(object):
    def findLongestWord(self, s, dictionary):
        """
        :type s: str
        :type dictionary: List[str]
        :rtype: str
        """
        dictionary.sort(key=lambda x: (1000-len(x), x))
        for word in dictionary:
            if len(word) > len(s):
                continue
            i = 0
            for c in s:
                if i < len(word) and c == word[i]:
                    i += 1
            if i == len(word):
                return word
        return ''

 

日期: 2021-04-03 

内容总结

以上是互联网集市为您收集整理的Leetcode 524. Longest Word in Dictionary through Deleting全部内容，希望文章能够帮你解决Leetcode 524. Longest Word in Dictionary through Deleting所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---