码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode]Trie-720. Longest Word in Dictionary

时间:2018-01-13 21:00:26      阅读:225      评论:0      收藏:0      [点我收藏+]

标签:span   ict   graph   string   from   long   call   example   str   

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].
    lass Solution {  
    public:  
        string longestWord(vector<string>& words) {  
            int a=words.size();  
             int t=0;  
                 int max= words[0].size();    
                for (int i=0;i<a;i++)  
                {  
                   
                if (words[i].size()>max)  
                   {  
                    max=words[i].size();  
                     t=i;  
                   }      
                }  
                return words[t];  
                }  
    };  

     

[leetcode]Trie-720. Longest Word in Dictionary

标签:span   ict   graph   string   from   long   call   example   str   

原文地址:https://www.cnblogs.com/chenhan05/p/8280259.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!