[Leetcode] Decode string decoding strings

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< /c3> times. Note that K was guaranteed to be a positive integer.

Assume that the input string was always valid; No extra white spaces, square brackets is well-formed, etc.

Furthermore, assume that the original data does not contain any digits and that digits is only for those repeat N Umbers, K. For example, there won ' t is 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 decoding strings