Maintain a count stack and a string stack. Push context when you hit '[' and restore it when you hit ']'.

Decode String

medium

Acceptance: 49%

StackStringRecursion

Decode a string that has been encoded with the pattern k[substring], where k is a positive integer and substring is the text to be repeated k times. Brackets may be nested. Assume the input is always syntactically correct with no extraneous spaces.

Examples

Example 1:

Input:s = "2[xy]3[z]"

Output:"xyxyzzzz"

Example 2:

Input:s = "2[a3[b]]"

Output:"abbbabbb"

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Decode String

Examples

Hints

Related Problems