Longest Words

最新推荐文章于 2021-01-29 19:08:50 发布

原创最新推荐文章于 2021-01-29 19:08:50 发布 · 377 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种算法，该算法接收一个字符串数组作为输入，并返回数组中所有长度最长的单词。通过两次遍历数组来实现：第一次找到最长单词的长度；第二次收集所有符合该长度的单词。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Given

{
“dog”,
“google”,
“facebook”,
“internationalization”,
“blabla”
}
the longest words are(is) [“internationalization”].

Given

{
“like”,
“love”,
“hate”,
“yes”
}
the longest words are [“like”, “love”, “hate”].


public class Solution {
    /**
     * @param dictionary: an array of strings
     * @return: an arraylist of strings
     */
    ArrayList<String> longestWords(String[] dictionary) {
        int max = 0;
        ArrayList<String> ans = new ArrayList ();
        for (int i = 0;i < dictionary.length; i++ ) {
            if (dictionary[i].length() >= max) {
                max = dictionary [i].length();

            }
        }
        for (int i = 0; i<dictionary.length ; i++ ) {
            if (dictionary[i].length() == max){
            ans.add(dictionary[i]);
            }

        }
        return ans;
    }
}