|
2 | 2 |
|
3 | 3 | importjava.util.Stack; |
4 | 4 |
|
| 5 | +/**394. Decode String |
| 6 | + * |
| 7 | + * Given an encoded string, return it's decoded string. |
| 8 | + * The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. |
| 9 | + * Note that k is guaranteed to be a positive integer. |
| 10 | + * You may assume that the input string is always valid; |
| 11 | + * No extra white spaces, square brackets are well-formed, etc. |
| 12 | + * Furthermore, you may assume that the original data does not contain any digits and |
| 13 | + * that digits are only for those repeat numbers, k. For example, there won't be input like 3a or 2[4]. |
| 14 | + * |
| 15 | + * Examples: |
| 16 | + * s = "3[a]2[bc]", return "aaabcbc". |
| 17 | + * s = "3[a2[c]]", return "accaccacc". |
| 18 | + * s = "2[abc]3[cd]ef", return "abcabccdcdcdef". |
| 19 | + * */ |
| 20 | + |
5 | 21 | publicclass_394 { |
6 | 22 |
|
7 | 23 | publicstaticclassSolution1 { |
|