文件: root - text - article - 2020 - 01 - string-compression.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 341 次阅读, 22335 次搜索 | 87 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 341 次阅读, 22335 次搜索 | 87 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Twitter:
Given an array of characters with repeats, compress it in place. The length after compression should be less than or equal to the original array.
Example:
Input: ['a', 'a', 'b', 'c', 'c', 'c']
Output: ['a', '2', 'b', 'c', '3']
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 341 次阅读, 22335 次搜索 | 87 个单词 Given an array of characters with repeats, compress it in place. The length after compression should be less than or equal to the original array.
Example:
Input: ['a', 'a', 'b', 'c', 'c', 'c']
Output: ['a', '2', 'b', 'c', '3']
Here's a starting point:
class Solution(object):
def compress(self, chars):
# Fill this in.
print Solution().compress(['a', 'a', 'b', 'c', 'c', 'c'])
# ['a', '2', 'b', 'c', '3']
猜您喜欢...
- Number of Ways to Climb Stairs
- Consecutive Ones
- Detect Linked List Cycle
- Making a Height Balanced Binary Search Tree
- Sort a Partially Sorted List
- [Daily Problem] Remove k-th Last Element From Linked List
- Longest Substring Without Repeating Characters
- Daily Interview Problem: Min Range Needed to Sort
- Daily Interview Problem: Largest BST in a Binary Tree
- [Daily Problem] Longest Increasing Subsequence
©2006~2024 牛排过熟 - 0.00887 秒 - 2268.731 KB/s - 76 在线 内存: 494.35 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="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。