394. 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".

题目含义：按照格式解码字符串

 1     public String decodeString(String s) {
 2          String res = "";
 3         Stack<Integer> counts = new Stack<>();
 4         Stack<String> words = new Stack<>();
 5         int i=0;
 6         while (i<s.length())
 7         {
 8             if (Character.isDigit(s.charAt(i)))
 9             {
10                 int sum=0;
11                 while (Character.isDigit(s.charAt(i)))
12                 {
13                     sum = sum*10 + (s.charAt(i) - '0');
14                     i++;
15                 }
16                 counts.push(sum);
17             }else if (s.charAt(i) == '[')
18             {
19                 words.push(res);
20                 res="";
21                 i++;
22             }else if (s.charAt(i) == ']')
23             {
24                 StringBuilder sb = new StringBuilder(words.pop());
25                 int count = counts.pop();
26                 for (int j=0;j<count;j++) sb.append(res);
27                 res = sb.toString();
28                 i++;
29             }else{
30                 res+=s.charAt(i);
31                 i++;
32             }
33         }
34         return res;       
35     }