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 | 519 Views, 17688 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 | 519 Views, 17688 Search Bots | 67 Words Subscribe to Feed Burner

Related Articles

  1. Patterns for breaking down questions you haven
  2. Fix Brackets
  3. Batch Programming in XP
  4. PHP Unit Tests on VPS Server
  5. Maximum In A Stack
  6. Number of Ways to Climb Stairs
  7. Algorithm Interview: Shifted String
  8. Daily Interview Problem: Trapping Rainwater
  9. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  10. Find Pythagorean Triplets

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