lintcode-easy-Longest Words

转载于 2016-02-26 07:41:00 发布 · 101 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/goblinengineer/p/5219156.html

本文介绍了一种算法，该算法能从给定的字符串数组中找出所有最长的单词，并将其返回。通过一次遍历即可完成任务，提高了效率。

Given a dictionary, find all of the longest words in the dictionary.

Example

Given

{
  "dog",
  "google",
  "facebook",
  "internationalization",
  "blabla"
}

the longest words are(is) ["internationalization"].

Given

{
  "like",
  "love",
  "hate",
  "yes"
}

the longest words are ["like", "love", "hate"].

Challenge

It's easy to solve it in two passes, can you do it in one pass?

class Solution {
    /**
     * @param dictionary: an array of strings
     * @return: an arraylist of strings
     */
    ArrayList<String> longestWords(String[] dictionary) {
        // write your code here
        ArrayList<String> result = new ArrayList<String>();
        
        if(dictionary == null || dictionary.length == 0)
            return result;
        
        for(int i = 0; i < dictionary.length; i++){
            if(result.size() == 0)
                result.add(dictionary[i]);
            else{
                if(dictionary[i].length() > result.get(result.size() - 1).length()){
                    result = new ArrayList<String>();
                    result.add(dictionary[i]);
                }
                else if(dictionary[i].length() == result.get(result.size() - 1).length()){
                    result.add(dictionary[i]);
                }
            }
        }
        
        return result;
    }
};