#820
Short Encoding of Words
specialist · 735 · lc medium +31 · verified · 60.8% accepted · 1,783 likes · top 60%
Description
A valid encoding of an array words is defined by a reference string s and an index array indices satisfying:
- words.length == indices.length
- The reference string s ends with '#'.
- For each indices[i], the substring of s starting at indices[i] and ending just before the next '#' equals words[i].
Given an array of words, return the length of the shortest possible reference string s in any valid encoding.
Example 1:
Input: words = ["time", "me", "bell"]
Output: 10
Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"
Example 2:
Input: words = ["t"]
Output: 2
Explanation: A valid encoding would be s = "t#" and indices = [0].
Code
1
2
3