Leetcode-394. Decode String

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。这次比赛略无语，没想到前3题都可以用暴力解。

博客链接：mcf171的博客

——————————————————————————————

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

这个题目还是折腾了一段时间。 Your runtime beats 54.24% of java submissions.

public class Solution {
    public String decodeString(String s) {
        int count = 0;
        Stack<Integer> num = new Stack<Integer>();
        Stack<String> str = new Stack<String>();
        StringBuffer buffer = new StringBuffer("");
        for(int i = 0; i < s.length(); i ++){
            char ch = s.charAt(i);
            if((ch - '0') * (ch - '9') <=0){
                count = count * 10 + (ch - '0');
            }
            else if(ch == '[') {
                num.push(count);
                count = 0;
                if(buffer.length() != 0) {
                    str.push(buffer.toString());
                    buffer.setLength(0);
                }
            }
            else if(ch == ']'){
                count = num.pop();
                StringBuffer repeatBuffer = new StringBuffer("");
                for(int k = 0 ; k < count ; k ++) repeatBuffer.append(buffer);
                if(!str.empty())repeatBuffer.insert(0,str.pop());
                buffer = repeatBuffer;
                count = 0;
            }else{
                buffer.append(ch);
            }
        }
       
        return buffer.toString();
    }
}