decode-string

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

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 original 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

&#32473;&#23450;&#19968;&#20010;&#32463;&#36807;&#32534;&#30721;&#30340;&#23383;&#31526;&#20018;&#65292;&#36820;&#22238;&#23427;&#35299;&#30721;&#21518;&#30340;&#23383;&#31526;&#20018;&#12290;

&#32534;&#30721;&#35268;&#21017;&#20026;: <code>k[encoded_string]</code>&#65292;&#34920;&#31034;&#20854;&#20013;&#26041;&#25324;&#21495;&#20869;&#37096;&#30340; <code>encoded_string</code> &#27491;&#22909;&#37325;&#22797; <code>k</code> &#27425;&#12290;&#27880;&#24847; <code>k</code> &#20445;&#35777;&#20026;&#27491;&#25972;&#25968;&#12290;

&#20320;&#21487;&#20197;&#35748;&#20026;&#36755;&#20837;&#23383;&#31526;&#20018;&#24635;&#26159;&#26377;&#25928;&#30340;&#65307;&#36755;&#20837;&#23383;&#31526;&#20018;&#20013;&#27809;&#26377;&#39069;&#22806;&#30340;&#31354;&#26684;&#65292;&#19988;&#36755;&#20837;&#30340;&#26041;&#25324;&#21495;&#24635;&#26159;&#31526;&#21512;&#26684;&#24335;&#35201;&#27714;&#30340;&#12290;

&#27492;&#22806;&#65292;&#20320;&#21487;&#20197;&#35748;&#20026;&#21407;&#22987;&#25968;&#25454;&#19981;&#21253;&#21547;&#25968;&#23383;&#65292;&#25152;&#26377;&#30340;&#25968;&#23383;&#21482;&#34920;&#31034;&#37325;&#22797;&#30340;&#27425;&#25968; <code>k</code> &#65292;&#20363;&#22914;&#19981;&#20250;&#20986;&#29616;&#20687;&nbsp;<code>3a</code>&nbsp;&#25110;&nbsp;<code>2[4]</code>&nbsp;&#30340;&#36755;&#20837;&#12290;

&#27979;&#35797;&#29992;&#20363;&#20445;&#35777;&#36755;&#20986;&#30340;&#38271;&#24230;&#19981;&#20250;&#36229;&#36807;&nbsp;<code>105</code>&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;s = "3[a]2[bc]"
&#36755;&#20986;&#65306;"aaabcbc"
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;s = "3[a2[c]]"
&#36755;&#20986;&#65306;"accaccacc"
</pre>

&#31034;&#20363; 3&#65306;

<pre>
&#36755;&#20837;&#65306;s = "2[abc]3[cd]ef"
&#36755;&#20986;&#65306;"abcabccdcdcdef"
</pre>

&#31034;&#20363; 4&#65306;

<pre>
&#36755;&#20837;&#65306;s = "abc3[cd]xyz"
&#36755;&#20986;&#65306;"abccdcdcdxyz"
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= s.length &lt;= 30</code></li>
	<li><meta charset="UTF-8" /><code>s</code>&nbsp;&#30001;&#23567;&#20889;&#33521;&#25991;&#23383;&#27597;&#12289;&#25968;&#23383;&#21644;&#26041;&#25324;&#21495;<meta charset="UTF-8" />&nbsp;<code>'[]'</code> &#32452;&#25104;</li>
	<li><code>s</code>&nbsp;&#20445;&#35777;&#26159;&#19968;&#20010;&nbsp;&#26377;&#25928;&nbsp;&#30340;&#36755;&#20837;&#12290;</li>
	<li><code>s</code>&nbsp;&#20013;&#25152;&#26377;&#25972;&#25968;&#30340;&#21462;&#20540;&#33539;&#22260;&#20026;<meta charset="UTF-8" />&nbsp;<code>[1, 300]</code>&nbsp;</li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support