zoukankan      html  css  js  c++  java
  • LeetCode-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".
    
    Solution:
    public class Solution {
        public String decodeString(String s) {
            StringBuilder builder = new StringBuilder();
            decodeStringRecur(s.toCharArray(),builder,0);
            return builder.toString();
        }
        
        public int decodeStringRecur(char[] sArr, StringBuilder builder, int start){
            if (start>=sArr.length){
                return start;
            }
            
            int p1 = start;
            while (p1<sArr.length && sArr[p1]!=']'){
                if (sArr[p1]<'0' || sArr[p1]>'9'){
                    builder.append(sArr[p1++]);
                } else {
                    // get the following encoded string.
                    // get the number first.
                    int val = 0;
                    while (p1<sArr.length && sArr[p1]!='['){
                        val = val*10 + (int)(sArr[p1++]-'0');
                    }
                    
                    // get the string.
                    StringBuilder subBuilder = new StringBuilder();
                    p1 = decodeStringRecur(sArr,subBuilder,p1+1);
                    
                    // add into decoded string.
                    for (int i=0;i<val;i++){
                        builder.append(subBuilder);
                    }
                }
            }
            
            return (p1<sArr.length) ? p1+1 : p1;
        }
    }
     
     
  • 相关阅读:
    sql学习笔记
    正则表达式30分钟入门教程(转) 收藏
    学习Javascript闭包(Closure)
    Bug等级规范
    下载1G的东西用1M网速理论上要用多长时间?
    C#多线程学习(四) 多线程的自动管理(线程池)
    JS调用WebServers
    北京软件公司排名
    Js调用WebServices
    C#多线程学习(三) 生产者和消费者
  • 原文地址:https://www.cnblogs.com/lishiblog/p/5874147.html
Copyright © 2011-2022 走看看