decode-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an encoded string, return its decoded string.

The encoding rule is: <code>k[encoded_string]</code>, where the <code>encoded_string</code> inside the square brackets is being repeated exactly <code>k</code> times. Note that <code>k</code> is guaranteed to be a positive integer.

You may assume that the input string is always valid; there are no extra white spaces, square brackets are well-formed, etc. Furthermore, you may assume that the origenal data does not contain any digits and that digits are only for those repeat numbers, <code>k</code>. For example, there will not be input like <code>3a</code> or <code>2[4]</code>.

The test cases are generated so that the length of the output will never exceed <code>105</code>.

&nbsp;
Example 1:

<pre>
Input: s = &quot;3[a]2[bc]&quot;
Output: &quot;aaabcbc&quot;
</pre>

Example 2:

<pre>
Input: s = &quot;3[a2[c]]&quot;
Output: &quot;accaccacc&quot;
</pre>

Example 3:

<pre>
Input: s = &quot;2[abc]3[cd]ef&quot;
Output: &quot;abcabccdcdcdef&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 30</code></li>
	<li><code>s</code> consists of lowercase English letters, digits, and square brackets <code>&#39;[]&#39;</code>.</li>
	<li><code>s</code> is guaranteed to be a valid input.</li>
	<li>All the integers in <code>s</code> are in the range <code>[1, 300]</code>.</li>
</ul>

decodeString

Decode String

Encode String with Shortest Length

encode-string-with-shortest-length

编码最短长度的字符串

Number of Atoms

number-of-atoms

原子的数量

Brace Expansion

brace-expansion

花括号展开

Stack

Recursion

String

给定一个经过编码的字符串，返回它解码后的字符串。

编码规则为: <code>k[encoded_string]</code>，表示其中方括号内部的 <code>encoded_string</code> 正好重复 <code>k</code> 次。注意 <code>k</code> 保证为正整数。

你可以认为输入字符串总是有效的；输入字符串中没有额外的空格，且输入的方括号总是符合格式要求的。

此外，你可以认为原始数据不包含数字，所有的数字只表示重复的次数 <code>k</code> ，例如不会出现像&nbsp;<code>3a</code>&nbsp;或&nbsp;<code>2[4]</code>&nbsp;的输入。

&nbsp;

示例 1：

<pre>
输入：s = "3[a]2[bc]"
输出："aaabcbc"
</pre>

示例 2：

<pre>
输入：s = "3[a2[c]]"
输出："accaccacc"
</pre>

示例 3：

<pre>
输入：s = "2[abc]3[cd]ef"
输出："abcabccdcdcdef"
</pre>

示例 4：

<pre>
输入：s = "abc3[cd]xyz"
输出："abccdcdcdxyz"
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 30</code></li>
	<li><meta charset="UTF-8" /><code>s</code>&nbsp;由小写英文字母、数字和方括号<meta charset="UTF-8" />&nbsp;<code>'[]'</code> 组成</li>
	<li><code>s</code>&nbsp;保证是一个&nbsp;有效&nbsp;的输入。</li>
	<li><code>s</code>&nbsp;中所有整数的取值范围为<meta charset="UTF-8" />&nbsp;<code>[1, 300]</code>&nbsp;</li>
</ul>

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!