【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 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".
package main
import(
	"regexp"
	"fmt"
	"strings"
	"strconv"
)
func decodeString(s string) string {
	var tmp string
	var num int
	reg := regexp.MustCompile(`[1-9]\d*\[[a-zA-Z]+\]`)
	for len(reg.FindAllString(s,-1))!=0{
		result := reg.FindAllString(s, -1)
		for _, v := range result{
			tmp = ""
			start := strings.Index(v, "[")
			end := strings.Index(v, "]")
			num, _ = strconv.Atoi(v[0:start])
			str := v[start+1:end]
			for num > 0{
				tmp = tmp + str
				num--
			}
			s = strings.Replace(s, v, tmp, -1)
		}
	}
	return s
}
func main(){
	text := "10[abc]"
	fmt.Println(decodeString(text))
}

 

import java.util.Stack;

class num394 {
    public String decodeString(String s) {
        Stack<Integer> intStack = new Stack<Integer>();
        Stack<StringBuilder> sbStack = new Stack<>();
        int k = 0;
        StringBuilder sb = new StringBuilder();
        for(char c: s.toCharArray()){
            if(Character.isDigit(c)){
                k = k * 10 + (c - '0');
            }else if(c == '['){
                intStack.push(k);
                sbStack.push(sb);
                k = 0;
                sb = new StringBuilder();
            }else if(c == ']'){
                StringBuilder temp = sb;
                sb = sbStack.pop();
                for(int i=intStack.pop(); i>0; i--){
                    sb.append(temp);
                }            
            }else{
                sb.append(c);
            }
        }
        return sb.toString();
    }
    public static void main(String[] args) {
        String s = "3[a]2[bc]";
        num394 solution = new num394();
        System.out.println(solution.decodeString(s));
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值