LeetCode 394. Decode String（递归）

最新推荐文章于 2020-11-20 09:42:15 发布

da_kao_la

最新推荐文章于 2020-11-20 09:42:15 发布

阅读量212

点赞数

分类专栏： LeetCode 文章标签： LeetCode Medium Java 递归

本文链接：https://blog.csdn.net/da_kao_la/article/details/102635494

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

这篇博客讨论了如何解决LeetCode上的第394题——解码字符串。问题涉及将给定的编码字符串转化为其原始形式，其中编码规则为k[encoded_string]，表示encoded_string重复k次。文章提供了递归的解决方案，并给出了几个示例，如“3[a]2[bc]”解码为“aaabcbc”，“3[a2[c]]”解码为“accaccacc”，以及“2[abc]3[cd]ef”解码为“abcabccdcdcdef”。

摘要由CSDN通过智能技术生成

Decode String

Medium

Given an encoded string, return its 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”.

思路

递归

代码

class Solution {
    private int i = 0;
    
    public String decodeString(String s) {
        char ch = 0;
        int n = s.length(), j = 0, num = 0;
        StringBuilder sb = new StringBuilder();
        while (i < n) {
            ch = s.charAt(i++);
            if (ch == '[') {
                String ss = decodeString(s);
                for (j=0; j<num; ++j) {
                    sb.append(ss);
                }
                num = 0;
            } else if (ch == ']') {
                return sb.toString();
            } else if (ch >= '0' && ch <= '9') {
                num = num * 10 + ch - '0';
            } else {
                sb.append(ch);
            }
        }
        return sb.toString();
    }
}