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

Related Articles

  1. Daily Interview Problem: Largest Product of 3 Elements I
  2. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  3. [Daily Problem] Longest Palindromic Substring
  4. Algorithm Interview: No Adjacent Repeating Characters
  5. Fix Brackets
  6. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  7. Daily Interview Puzzle: Minimum Size Subarray Sum
  8. Daily Interview Problem: Decode String
  9. Skip the readings, focus on problems. And use all the hints!
  10. Binary Tree Level with Minimum Sum

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