超级会员免费看
该博客详细介绍了如何解决LeetCode第443题——字符串压缩问题。通过实例分析，解释了如何在原地修改字符数组进行压缩，并确保压缩后的数组长度小于等于原长度。文章探讨了只使用O(1)额外空间的解决方案，并强调了理解题目要求在原地修改的重要性。
Given an array of characters, compress it in-place.
The length after compression must always be smaller than or equal to the original array.
Every element of the array should be a character (not int) of length 1.
After you are done modifying the input array in-place, return the new length of the array.
Follow up:
Could you solve it using only O(1) extra space?
Example 1:
Input:
["a","a","b","b","c","c","c"]
Output:
Return 6, and the first 
订阅专栏 解锁全文
扫一扫
420
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
