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

Related Articles

  1. Binary Tree Level with Minimum Sum
  2. Patterns for breaking down questions you haven
  3. Two Tricks of Delphi
  4. Daily Interview Problem: Look and Say Sequence
  5. Generate All IP Addresses
  6. Daily Interview Problem: Validate Binary Search Tree
  7. Daily Interview Problem: Distribute Bonuses
  8. [Daily Problem] Longest Palindromic Substring
  9. Find Pythagorean Triplets
  10. Sorting a list with 3 unique numbers

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