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

Related Articles

  1. Daily Interview Problem: Min Stack
  2. Daily Interview Puzzle: Intersection of Linked Lists
  3. Daily Interview Problem: Validate Binary Search Tree
  4. Sorting a list with 3 unique numbers
  5. Skip the readings, focus on problems. And use all the hints!
  6. Algorithm Interview: Maximum Path Sum in Binary Tree
  7. Two Tricks of Delphi
  8. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  9. Find the non-duplicate number
  10. Print a tree level-by-level, with line-breaks

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