【LeetCode】648.Replace Words(Medium)解题报告
2017-12-12 08:49
465 查看
【LeetCode】648.Replace Words(Medium)解题报告
题目地址:https://leetcode.com/problems/replace-words/description/
题目描述:
In English, we have a concept called root, which can be followed by some other words to form another longer word - let’s call this word successor. For example, the root an, followed by other, which can form another word another.
Now, given a dictionary consisting of many roots and a sentence. You need to replace all the successor in the sentence with the root forming it. If a successor has many roots can form it, replace it with the root with the shortest length.
You need to output the sentence after the replacement.
Solution:
Date:2017年12月12日
题目地址:https://leetcode.com/problems/replace-words/description/
题目描述:
In English, we have a concept called root, which can be followed by some other words to form another longer word - let’s call this word successor. For example, the root an, followed by other, which can form another word another.
Now, given a dictionary consisting of many roots and a sentence. You need to replace all the successor in the sentence with the root forming it. If a successor has many roots can form it, replace it with the root with the shortest length.
You need to output the sentence after the replacement.
Note: 1. The input will only have lower-case letters. 2. 1 <= dict words number <= 1000 3. 1 <= sentence words number <= 1000 4. 1 <= root length <= 100 5. 1 <= sentence words length <= 1000
Input: dict = ["cat", "bat", "rat"] sentence = "the cattle was rattled by the battery" Output: "the cat was rat by the bat"
Solution:
class Solution { public String replaceWords(List<String> dict, String sentence) { Set<String> set = new HashSet<>(dict); StringBuilder sb = new StringBuilder(); String[] words = sentence.split(" "); for(int i=0;i<words.length;i++){ for(int j=0;j<words[i].length();j++){ String root = words[i].substring(0,j); if(set.contains(root)){ words[i]=root; } } sb.append(words[i]+" "); } return sb.substring(0,sb.length()-1); } }
Date:2017年12月12日
相关文章推荐
- 【LeetCode】77.Combinations(Medium)解题报告
- 【LeetCode】47.Permutations II(Medium)解题报告
- LeetCode解题报告 96. Unique Binary Search Trees [medium]
- 【LeetCode】289.Game of Life(Medium)解题报告
- LeetCode解题报告 399. Evaluate Division [medium]
- 【LeetCode】109.Convert Sorted List to Binary Search Tree(Medium)解题报告
- 【LeetCode】98. Validate Binary Search Tree(Medium)解题报告
- LeetCode解题报告 445. Add Two Numbers II [medium]
- LeetCode解题报告 55. Jump Game [medium]
- 【LeetCode】646.Maximum Length of Pair Chain(Medium)解题报告
- 【LeetCode】55.Jump Game(Medium)解题报告
- 【LeetCode】40.Combination Sum II(Medium)解题报告
- 【LeetCode】31.Next Permutation(Medium)解题报告
- 【LeetCode】80.Remove Duplicates from Sorted Array II(Medium)解题报告
- LeetCode解题报告 279. Perfect Squares [medium]
- LeetCode解题报告 357. Count Numbers with Unique Digits [medium]
- 【LeetCode】228.Summary Ranges(Medium)解题报告
- 【LeetCode】413.Arithmetic Slices(Medium)解题报告
- 【LeetCode】513.Find Bottom Left Tree Value(Medium)解题报告
- 【LeetCode】46.Permutations(Medium)解题报告