[LeetCode] Decode String 解码字符串
Posted Grandyang
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[LeetCode] Decode String 解码字符串相关的知识，希望对你有一定的参考价值。
Given an encoded string, return it‘s decoded string.
The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.
You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.
Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there won‘t be input like 3a or 2[4].
Examples:
s = "3[a]2[bc]", return "aaabcbc". s = "3[a2[c]]", return "accaccacc". s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
s
以上是关于[LeetCode] Decode String 解码字符串的主要内容，如果未能解决你的问题，请参考以下文章
Leetcode -- 394. Decode String
LeetCode-394. Decode String(DFS)