Leetcode
2020.05.07 03:50

720. Longest Word in Dictionary

조회 수 493 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

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 {
public String longestWord(String[] words) {
Map<Integer, String> hmap = new HashMap<>();
int max = Integer.MIN_VALUE;

for(String word : words){
Set<Character> set = new HashSet<>();
for(Character c : word.toCharArray()){
}

if(max <= set.size()){
max = set.size();
if(hmap.containsKey(max)){
if(word.compareTo(hmap.get(max)) > 0){
//hmap.remove(max);
hmap.put(max, word);
}
}else{
hmap.put(max, word);
}
}
}

if(hmap.containsKey(max)){
return hmap.get(max);
}

return "";
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
1. 720. Longest Word in Dictionary

2. 225. Implement Stack using Queues

3. 56. Merge Intervals

4. 844. Backspace String Compare

5. 222. Count Complete Tree Nodes

6. 697. Degree of an Array

7. 605. Can Place Flowers

8. 724. Find Pivot Index

9. 448. Find All Numbers Disappeared in an Array

10. 628. Maximum Product of Three Numbers

11. 532. K-diff Pairs in an Array

12. 897. Increasing Order Search Tree

13. 872. Leaf-Similar Trees

14. 876. Middle of the Linked List

15. 203. Remove Linked List Elements

16. 997. Find the Town Judge

17. 270. Closest Binary Search Tree Value

18. 687. Longest Univalue Path

19. 783. Minimum Distance Between BST Nodes

20. 235. Lowest Common Ancestor of a Binary Search Tree

Board Pagination Prev 1 2 3 4 Next
/ 4