Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.
Machine 1 (sender) has the function:
String encode(List<String> strs) {
// ... your code
return encoded_string;
}Machine 2 (receiver) has the function:
List<String> decode(String encoded_string) {
// ... your code
return decoded_strs;
}So Machine 1 does:
String encoded_string = encode(strs);and Machine 2 does:
List<String> decoded_strs = decode(encoded_string);decoded_strs in Machine 2 should be the same as the input strs in Machine 1.
Implement the encode and decode methods.
Example 1:
Input: strs = ["Hello","World"]
Output: ["Hello","World"]Explanation:
Solution solution = new Solution();
String encoded_string = solution.encode(strs);
// Machine 1 ---encoded_string---> Machine 2
List<String> decoded_strs = solution.decode(encoded_string);Example 2:
Input: strs = [""]
Output: [""]Constraints:
0 <= strs.length < 1000 <= strs[i].length < 200strs[i]contains any possible characters out of256valid ASCII characters.
Follow up: Could you write a generalized algorithm to work on any possible set of characters?
Topics
Recommended Time & Space Complexity
You should aim for a solution with O(m) time for each encode() and decode() call and O(m+n) space, where m is the sum of lengths of all the strings and n is the number of strings.
Hint 1
A naive solution would be to use a non-ascii character as a delimiter. Can you think of a better way?
Hint 2
Try to encode and decode the strings using a smart approach based on the lengths of each string. How can you differentiate between the lengths and any numbers that might be present in the strings?
Hint 3
We can use an encoding approach where we start with a number representing the length of the string, followed by a separator character (let's use # for simplicity), and then the string itself. To decode, we read the number until we reach a #, then use that number to read the specified number of characters as the string.