2. 程式人生 > >Leetcode -- 394. Decode String

Leetcode -- 394. Decode String

阿新 • • 發佈：2017-10-05
inside rul ted script form you 給定 rac 會有

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".

思路: 一個DFS的題目, 給定的字符串可能會有嵌套很多層, 在每一層我們只要在碰到正常的字符就保存到當前層的結果中, 如果碰到數字就另外保存起來作為倍數, 碰到‘[‘ 就進入下層遞歸, 碰到‘]‘ 就將當前層結果返回, 這樣在返回給上層之後就可以用倍數加入到上層結果字符串中. 最終當所有層都完成之後就可以得到結果. 在不同層次的遞歸中, 我們可以維護一個共同的位置索引, 這樣在下層遞歸完成之後上層可以知道已經運算到哪裏了.

DFS的思想： ?

Leetcode -- 394. Decode String

相關推薦

Leetcode -- 394. Decode String

inside rul ted script form you 給定 rac 會有 Given an encoded string, return it‘s decoded string. The encoding rule is: k[encoded_string], w

python leetcode 394. Decode String

考察程式碼的編寫能力 棧和字串的操作 注意的地方是數字可能是111這樣的大於10的數字 字母要考慮大小寫 左右括號要對應 class Solution: def decodeString(self, s): """ :type s: str

394. Decode String 解碼icc字符串3[i2[c]]

extra ted ike 為什麽 tee put style 一句話 inside ［抄題］： Given an encoded string, return it‘s decoded string. The encoding rule is: k[encoded_str

394. Decode String

push digi char color else [] git arr ont 用curString去記錄前面的String的結果 1 class Solution { 2 public String decodeString(String s) {

DFS+回溯專題12 - leetcode95. Unique Binary Search Trees II/394. Decode String - Mark

95. Unique Binary Search Trees II 題目描述 給定整數n，產生儲存1…n的結構上唯一的二叉搜尋樹。 例子 Input: 3 Output: [ [1,null,3,2], [3,2,null,1], [3,1,null

394. Decode String （解碼字串）

Given an encoded string, return it’s decoded string. The encoding rule is: k[encoded_string], where the encoded_strin

Decode String(394)

394— Decode String Given an encoded string, return it’s decoded string. The encoding rule is: k[encoded_string], where the encoded_string insi

[leetcode-541-Reverse String II]

string cnblogs div tco ever 大神 turn letter 字符 Given a string and an integer k, you need to reverse the first k characters for every 2k c

[LeetCode] 344 Reverse String & 541 Reverse String II

let 庫函數 code only urn out pro 滿足 function 原題地址： 344 Reverse String: https://leetcode.com/problems/reverse-string/description/ 541 Reverse

LeetCode - 541. Reverse String II

there less clas c ++ urn then con rom append Given a string and an integer k, you need to reverse the first k characters for every 2k cha

Leetcode 91. Decode Ways 解碼方法(動態規劃，字符串處理)

範圍 解碼 length emp 添加 substr temp 字母 decode Leetcode 91. Decode Ways 解碼方法(動態規劃，字符串處理) 題目描述 一條報文包含字母A-Z，使用下面的字母-數字映射進行解碼 'A' ->

LeetCode 541. Reverse String II

out int urn etc first code amp abcd ESS question: Given a string and an integer k, you need to reverse the first k characters for every

LeetCode 344. Reverse String(反轉字符串)

length stringbu pro class 反轉字符串 reverse str pub string 題目描述 LeetCode 344. 反轉字符串 請編寫一個函數，其功能是將輸入的字符串反轉過來。 示例 輸入： s = "hello"

leetcode-796-Rotate String

叠代 osi ++ AS 最終 break style 隊列 dfa 題目描述： We are given two strings, A and B. A shift on A consists of taking string A and moving the leftm

[LeetCode] Custom Sort String 自定義排序的字符串

iou sort all out sorted abcd tput example bcd S and T are strings composed of lowercase letters. In S, no letter occurs more than once

LeetCode 91. Decode Ways

由於 lee ++ mea 本質 限制 num bin 很多 這道題本質上和 Climbing Stairs 那道DP題是一樣的，但是由於 decode 有範圍限制，所以寫起來有很多條件。 dp[i] 表示到下標為i為止的字符能得到的解碼個數 dp[i] += dp[i

[LeetCode] 87. Scramble String 爬行字符串

brush swap ngs art control any ldr lean and Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty s

LeetCode-926 flip-string-to-monotone-increasing 字串翻轉到單調遞增

題目連結 LeetCode 周賽 107場 B題 https://leetcode-cn.com/contest/weekly-contest-107/problems/flip-string-to-monotone-increasing/ 題意 中文題，這個遞增允許不變，例如全

[LeetCode] 91. Decode Ways

題：https://leetcode.com/problems/decode-ways/description/ 題目 A message containing letters from A-Z is being encoded to numbers using the follow

【LeetCode】字串 string（共112題）

p.p1 { margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica } 【3】Longest Substring Without Repeating Characters  【5】Longest Palindromic Substring