文件: root - text - article - 2019 - 12 - decode-string.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 469 次阅读, 16551 次搜索 | 67 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 469 次阅读, 16551 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 469 次阅读, 16551 次搜索 | 67 个单词 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
猜您喜欢...
- Algorithm Interview: Convert Roman Numerals to Decimal
- Design Tic-Tac-Toe
- Staying on a Chess Board
- Algorithm Interview: Subarray With Target Sum
- Kaprekar
- Daily Interview Problem: Reverse Words in a String
- Palindrome Integers
- Longest Substring Without Repeating Characters
- Algorithm Interview: String Compression
- Daily Interview Problem: Validate Binary Search Tree
最后更新: October 30 2020 14:21:12 |
©2006~2024 牛排过熟 - 0.03206 秒 - 1638.043 KB/s - 66 在线 
内存: 528.54 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
内存: 528.54 KB18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。