To the Top
File:  root - text - article - 2019 - 12 - decode-string.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 517 Views, 17550 Search Bots | 67 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Google:

Given a string with a certain rule: k[string] should be expanded to string k times. So for example, 3[abc] should be expanded to abcabcabc. Nested expansions can happen, so 2[a2[b]c] should be expanded to abbcabbc.

Your starting point:

def decodeString(s):
# Fill this in.

print decodeString('2[a2[b]c]')
# abbcabbc
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 517 Views, 17550 Search Bots | 67 Words Subscribe to Feed Burner

Related Articles

  1. [Daily Problem] Angles of a Clock
  2. Daily Interview Problem: Min Range Needed to Sort
  3. Daily Interview Puzzle: Intersection of Linked Lists
  4. Non-decreasing Array with Single Modification
  5. Daily Interview Problem: 3 Sum
  6. Consecutive Ones
  7. Longest Substring Without Repeating Characters
  8. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  9. Daily Interview Problem: Trapping Rainwater
  10. Daily Interview Problem: Longest Substring With K Distinct Characters

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />