成人无码视频,亚洲精品久久久久av无码,午夜精品久久久久久毛片,亚洲 中文字幕 日韩 无码

資訊專(zhuān)欄INFORMATION COLUMN

[LintCode] Longest Words

roadtogeek / 3195人閱讀

Problem

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?

Solution
class Solution {
    ArrayList longestWords(String[] dictionary) {
        // write your code here
        ArrayList res = new ArrayList();
        for (String word: dictionary) {
            if (res.isEmpty() || res.get(0).length() < word.length()) {
                res.clear();
                res.add(word);
            }
            else if (res.get(0).length() == word.length()) res.add(word);
            else continue;
        }
        return res;
    }
}

文章版權(quán)歸作者所有,未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為,您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址:http://m.hztianpu.com/yun/65506.html

相關(guān)文章

  • [LintCode/LeetCode] Longest Palindrome Substring

    摘要:是左閉右開(kāi)區(qū)間,所以要。,要理解是和之間只有一個(gè)元素。循環(huán)每次的時(shí)候,都要更新子串更大的情況。補(bǔ)一種中點(diǎn)延展的方法循環(huán)字符串的每個(gè)字符,以該字符為中心,若兩邊為回文,則向兩邊繼續(xù)延展。循環(huán)返回長(zhǎng)度最長(zhǎng)的回文串即可。 Problem Given a string S, find the longest palindromic substring in S. You may assume ...

    AaronYuan 評(píng)論0 收藏0
  • [LintCode] Longest Substring Without Repeating Cha

    摘要:哈希表法雙指針?lè)ㄖ挥挟?dāng)也就是時(shí)上面的循環(huán)才會(huì)結(jié)束,,跳過(guò)這個(gè)之前的重復(fù)字符再將置為 Problem Given a string, find the length of the longest substring without repeating characters. Example For example, the longest substring without repeat...

    Scliang 評(píng)論0 收藏0
  • [LintCode] Longest Palindrome

    Problem Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This is case sensitive, for example Aa is not ...

    nicercode 評(píng)論0 收藏0
  • [LintCode] Longest Increasing Subsequence

    Problem Given a sequence of integers, find the longest increasing subsequence (LIS). You code should return the length of the LIS. Clarification Whats the definition of longest increasing subsequence?...

    Flands 評(píng)論0 收藏0
  • [LintCode] Longest Repeating Subsequence

    摘要:用二維數(shù)組進(jìn)行動(dòng)態(tài)規(guī)劃,作為第位和的位已有的重復(fù)子序列長(zhǎng)度最大值計(jì)數(shù)器。 Problem Given a string, find length of the longest repeating subsequence such that the two subsequence don’t have same string character at same position, i.e...

    Karuru 評(píng)論0 收藏0

發(fā)表評(píng)論

0條評(píng)論

閱讀需要支付1元查看
<