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

Related Articles

  1. [Daily Problem] Longest Increasing Subsequence
  2. Daily Interview Problem: Queue Using Two Stacks
  3. Daily Interview Problem: Find the k-th Largest Element in a List
  4. Find Missing Numbers in an Array
  5. Longest Substring Without Repeating Characters
  6. Daily Interview Problem: Merge Overlapping Intervals
  7. [Daily Problem] Validate Balanced Parentheses
  8. Algorithm Interview: Shifted String
  9. Two-Sum
  10. Algorithm Interview: Level Order Traversal of Binary Tree

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