zoukankan      html  css  js  c++  java
  • Hash Table-720. Longest Word in Dictionary

    Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest lexicographical order.

    If there is no answer, return the empty string.

    Example 1:

    Input: 
    words = ["w","wo","wor","worl", "world"]
    Output: "world"
    Explanation: 
    The word "world" can be built one character at a time by "w", "wo", "wor", and "worl".
    

    Example 2:

    Input: 
    words = ["a", "banana", "app", "appl", "ap", "apply", "apple"]
    Output: "apple"
    Explanation: 
    Both "apply" and "apple" can be built from other words in the dictionary. However, "apple" is lexicographically smaller than "apply".
    

    Note:

    • All the strings in the input will only contain lowercase letters.
    • The length of words will be in the range [1, 1000].
    • The length of words[i] will be in the range [1, 30].
    class Solution {
     2 public:
     3     string longestWord(vector<string>& words) {
     4         sort(words.begin(),words.end()) ;
     5         unordered_set<string> Set;
     6         string res = "" ;
     7         for(string w : words){
     8             if (w.length() == 1 || Set.count(w.substr(0,w.length()-1))){
     9                 res = w.length() > res.length() ? w : res ;
    10                 Set.insert(w) ;
    11             }
    12         }
    13         return res ;     
    14     }
    15 };
  • 相关阅读:
    简易自制线程池(备忘)
    大数据量的删除过程查看
    收集书籍备忘
    6月12日C代码
    fseek()
    区分int *p[4]与int (*p)[4]
    常用的字符串处理函数 C语言
    6月11日
    C学习代码
    文件读取 C语言
  • 原文地址:https://www.cnblogs.com/msymm/p/8253793.html
Copyright © 2011-2022 走看看