页面顶部 Top
文件:  root - text - article - 2019 - 12 - decode-string.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 514 次阅读, 17503 次搜索 | 67 个单词

定阅此目录的博客 | 浏览 | 博客存档
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
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 514 次阅读, 17503 次搜索 | 67 个单词 定阅此目录的博客

猜您喜欢...

  1. Fix Brackets
  2. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  3. Daily Interview Question: Create a Simple Calculator
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. Daily Interview Problem: Longest Substring With K Distinct Characters
  6. Floor and Ceiling of a Binary Search Tree
  7. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  8. Find the non-duplicate number
  9. Daily Interview Problem: Reverse Integer
  10. Two Tricks of Delphi

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />