[LeetCode] Encode String with Shortest Length 最短长度编码字符串

Posted Grandyang

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Encode String with Shortest Length 最短长度编码字符串相关的知识,希望对你有一定的参考价值。

 

Given a non-empty string, encode the string such that its encoded length is the shortest.

The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times.

Note:

  1. k will be a positive integer and encoded string will not be empty or have extra space.
  2. You may assume that the input string contains only lowercase English letters. The string‘s length is at most 160.
  3. If an encoding process does not make the string shorter, then do not encode it. If there are several solutions, return any of them is fine.

Example 1:

Input: "aaa"
Output: "aaa"
Explanation: There is no way to encode it such that it is shorter than the input string, so we do not encode it.

Example 2:

Input: "aaaaa"
Output: "5[a]"
Explanation: "5[a]" is shorter than "aaaaa" by 1 character.

Example 3:

Input: "aaaaaaaaaa"
Output: "10[a]"
Explanation: "a9[a]" or "9[a]a" are also valid solutions, both of them have the same length = 5, which is the same as "10[a]".

Example 4:

Input: "aabcaabcd"
Output: "2[aabc]d"
Explanation: "aabc" occurs twice, so one answer can be "2[aabc]d".

Example 5:

Input: "abbbabbbcabbbabbbc"
Output: "2[2[abbb]c]"
Explanation: "abbbabbbc" occurs twice, but "abbbabbbc" can also be encoded to "2[abbb]c", so one answer can be "2[2[abbb]c]".
 
s
 
 
 
 
 
 

 

以上是关于[LeetCode] Encode String with Shortest Length 最短长度编码字符串的主要内容,如果未能解决你的问题,请参考以下文章

Leetcode: Encode String with Shortest Length && G面经

[LeetCode] Encode String with Shortest Length 最短长度编码字符串

LeetCode-Encode and Decode Strings

[LeetCode] Encode and Decode TinyURL

Leetcode 535: Encode and Decode TinyURL

LeetCode 解题思路:535.Encode and Decode TinyURL