820. Short Encoding of Words

最新推荐文章于 2024-01-28 22:37:13 发布

多多趣

最新推荐文章于 2024-01-28 22:37:13 发布

阅读量177

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/excellentlizhensbfhw/article/details/84995457

版权

LeetCode 专栏收录该内容

548 篇文章

订阅专栏

本文探讨了一种有效的字符串编码方法，通过构建参考字符串和索引列表来压缩一组单词，旨在寻找最短的参考字符串长度。示例中，对于单词列表[“time”,“me”,“bell”]，编码为S=“time#bell#”，索引[0,2,5]，总长度为10。文章提供了一个Java程序实现，首先去除单词列表中的子串，然后计算剩余单词的总长度加上每个单词后的‘#’符号数量。

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

Given a list of words, we may encode it by writing a reference string S and a list of indexes A.

For example, if the list of words is [“time”, “me”, “bell”], we can write it as S = “time#bell#” and indexes = [0, 2, 5].

Then for each index, we will recover the word by reading from the reference string from that index until we reach a “#” character.

What is the length of the shortest reference string S possible that encodes the given words?

Example:
Input: words = [“time”, “me”, “bell”]
Output: 10
Explanation: S = “time#bell#” and indexes = [0, 2, 5].

Note:

1 <= words.length <= 2000.
1 <= words[i].length <= 7.
Each word has only lowercase letters.

字符串编码，程序如下所示：

class Solution {
    public int minimumLengthEncoding(String[] words) {
        Set<String> set = new HashSet<>(Arrays.asList(words));
        for (String s : words){
            int len = s.length();
            for (int i = 1; i < len; ++ i){
                String t = s.substring(i);
                if (set.contains(t)){
                    set.remove(t);
                }
            }
        }
        int cnt = 0;
        for (String s : set){
            cnt += s.length() + 1;
        }
        return cnt;
    }
}