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

Related Articles

  1. Daily Interview Problem: First Missing Positive Integer
  2. Detect Linked List Cycle
  3. Skip the readings, focus on problems. And use all the hints!
  4. How to Play WAV music under DOS?
  5. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  6. Daily Interview Question: Find Cycles in a Graph
  7. Progess made
  8. Algorithm Interview: String Compression
  9. Daily Interview Problem: Validate Binary Search Tree
  10. Daily Interview Problem: Merge Overlapping Intervals

Comments (0)

    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="index, follow">