leetcode 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 thatk 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 or2[4].

Examples:

s = "3[a]2[bc]", return "aaabcbc".
s = "3[a2[c]]", return "accaccacc".
s = "2[abc]3[cd]ef", return "abcabccdcdcdef".

import java.util.Stack;
import java.util.regex.Pattern;

public class Solution {
    public String decodeString(String s) {
        Stack<String> sta = new Stack<String>();
        char[] c = s.toCharArray();
        StringBuffer sb = new StringBuffer();
        StringBuffer result = new StringBuffer();
        for(int i = 0; i<c.length; i++){
            if(c[i]==']'){
                while(!(sta.peek()).equals("[")) {
                    sb.insert(0, sta.pop());
                }
                sta.pop();
                int num = Integer.parseInt(sta.pop());
                String sbtemp = sb.toString();
                for(int j=0;j<num-1;j++){
                    sb.append(sbtemp);
                }
                if(sta.size()==0){
                    result.append(sb);
                    sb.setLength(0);
                }
                else {
                    sta.push(sb.toString());
                    sb.setLength(0);
                }
            }
            else {
                Pattern pattern = Pattern.compile("[0-9]*");
                while(pattern.matcher(""+c[i]).matches()){
                    sb.append(c[i]);
                    i++;
                }
                if(sb.length()>0)
                    sta.push(sb.toString());
                sta.push("" + c[i]);
                sb.setLength(0);
            }
        }
        while(sta.size()>0){
            sb.insert(0,sta.pop());
        }
        return (result.append(sb)).toString();
    }
}