Leetcode_Sort --524. Longest Word in Dictionary through Deleting [medium]

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:

1、 All the strings in the input will only contain lower-case letters.
2.、The size of the dictionary won’t exceed 1,000.
3.、The length of all the strings in the input won’t exceed 1,000.

Solution：

Python

class Solution:
    def findLongestWord(self, s, d):
        """
        :type s: str
        :type d: List[str]
        :rtype: str
        """
        '''
        对输入的d进行排序
		这里的排序法则是先按照字符的长度的负数排序
		也就是按照长度从大到小排序
		当长度一样的时候，按照字母在字母表中的顺序排序
		'''

        D= sorted(d,key = lambda x: (-len(x),x))

        for word in D:
            i = 0
            for char in s:
                if i <len(word) and word[i] ==char:
                    i += 1
            if i == len(word):
                return word
        return ''

这段代码中，个人认为这个排序是精髓，首先比较的是字母更长的序列，以保证输出的是字母序列长度最大的的字符串，当长度相同的时候保证输出了再词典中字母顺序靠前的元素