Snapchat面试题: 单词缩写
描述
给出一组 n 个不同的非空字符串,您需要按以下规则为每个单词生成 最小 的缩写。
- 从第一个字符开始,然后加上中间缩写掉的字符的长度,后跟最后一个字符。
- 如果有冲突,就是多个单词共享相同的缩写,使用较长的前缀,而不是仅使用第一个字符,直到使单词的缩写的映射变为唯一。 换句话说,最终得到的缩写不能映射到多个原始单词。
- 如果缩写不会使单词更短,则不进行缩写,保持原样。
- n 和每个单词的长度均不会超过 400。
- 每个单词的长度大于 1。
- 这些词只包括小写英文字母。
- 返回答案应该与原始数组保持相同的顺序。
样例1
输入:
["like","god","internal","me","internet","interval","intension","face","intrusion"]
输出:
["l2e","god","internal","me","i6t","interval","inte4n","f2e","intr4n"]
样例 2
输入:
["where","there","is","beautiful","way"]
输出:
["w3e","t3e","is","b7l","way"]
源代码
class Solution:
# @param {string[]} dict an array of n distinct non-empty strings
# @return {string[]} an array of minimal possible abbreviations for every word
def wordsAbbreviation(self, dict):
# Write your code here
self.dict = {}
self.solve(dict, 0)
return list(map(self.dict.get, dict))
def abbr(self, word, size):
if len(word) - size <= 3:
return word
return word[:size + 1] + str(len(word) - size - 2) + word[-1]
def solve(self, dict, size):
dlist = collections.defaultdict(list)
for word in dict:
dlist[self.abbr(word, size)].append(word)
for abbr, wlist in dlist.items():
if len(wlist) == 1:
self.dict[wlist[0]] = abbr
else:
self.solve(wlist, size + 1)