File: root - text - article - 2020 - 01 - string-compression.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 330 Views, 20939 Search Bots | 87 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 330 Views, 20939 Search Bots | 87 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 330 Views, 20939 Search Bots | 87 Words 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']
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Detect Linked List Cycle
- First and Last Indices of an Element in a Sorted Array
- Daily Interview Problem: Arithmetic Binary Tree
- Consecutive Ones
- Daily Interview Problem: Deepest Node in a Binary Tree
- Algorithm Interview: Longest Consecutive Sequence
- Daily Interview Problem: First Missing Positive Integer
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
©2006~2024 SteakOverCooked - 0.01576 Seconds(s) - 1147.916 KB/s - 51 Online
Memory: 491.65 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !