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

Related Articles

  1. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  2. Daily Interview Problem: Find the k-th Largest Element in a List
  3. Daily Interview Problem: Longest Substring With K Distinct Characters
  4. Daily Interview Problem: Jump to the End
  5. Daily Interview Problem: Running Median
  6. Daily Interview Problem:Create a balanced binary search tree
  7. Algorithm Interview Question: Nth Fibonacci Number
  8. Absolute Path
  9. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  10. [Daily Problem] Longest Increasing Subsequence

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