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

Related Articles

  1. Algorithm Interview Question: H-Index
  2. Maximum In A Stack
  3. Daily Interview Puzzle: Minimum Size Subarray Sum
  4. Daily Interview Problem: Merge List Of Number Into Ranges
  5. Daily Interview Problem: First Missing Positive Integer
  6. [Daily Problem] Longest Palindromic Substring
  7. Most Frequent Subtree Sum
  8. Daily Interview Problem: Maximum Profit From Stocks
  9. Spreadsheet Column Title
  10. Progess made

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