鱼C论坛

 找回密码
 立即注册
查看: 619|回复: 0

[技术交流] 【朱迪的LeetCode刷题笔记】443. String Compression #Medium #Python

[复制链接]
发表于 2023-6-5 04:54:02 | 显示全部楼层 |阅读模式

马上注册,结交更多好友,享用更多功能^_^

您需要 登录 才可以下载或查看,没有账号?立即注册

x
本帖最后由 Judie 于 2023-6-4 15:56 编辑

Given an array of characters chars, compress it using the following algorithm:

Begin with an empty string s. For each group of consecutive repeating characters in chars:
- If the group's length is 1, append the character to s.
- Otherwise, append the character followed by the group's length.

The compressed string s should not be returned separately, but instead, be stored in the input character array chars. Note that group lengths that are 10 or longer will be split into multiple characters in chars.

After you are done modifying the input array, return the new length of the array.

You must write an algorithm that uses only constant extra space.

Example 1:
Input: chars = ["a","a","b","b","c","c","c"]
Output: Return 6, and the first 6 characters of the input array should be: ["a","2","b","2","c","3"]
Explanation: The groups are "aa", "bb", and "ccc". This compresses to "a2b2c3".

Example 2:
Input: chars = ["a"]
Output: Return 1, and the first character of the input array should be: ["a"]
Explanation: The only group is "a", which remains uncompressed since it's a single character.

Example 3:
Input: chars = ["a","b","b","b","b","b","b","b","b","b","b","b","b"]
Output: Return 4, and the first 4 characters of the input array should be: ["a","b","1","2"].
Explanation: The groups are "a" and "bbbbbbbbbbbb". This compresses to "ab12".

Constraints:
1 <= chars.length <= 2000
chars<i> is a lowercase English letter, uppercase English letter, digit, or symbol.

Judy
Python
  1. class Solution(object):
  2.     def compress(self, chars):
  3.         """
  4.         :type chars: List[str]
  5.         :rtype: int
  6.         """
  7.         count = 0
  8.         prev = chars[0]
  9.         i = 0
  10.         l = len(chars)
  11.         while i < l:
  12.             current = chars.pop(0)
  13.             
  14.             if prev != current:
  15.                 chars.append(prev)
  16.                 prev = current
  17.                 if count > 1:
  18.                     chars.extend(list(str(count)))

  19.                 count = 0
  20.             
  21.             count += 1
  22.             i += 1
  23.         
  24.         chars.append(prev)
  25.         if count > 1:
  26.             chars.extend(list(str(count)))
  27.         
  28.         return(len(chars))
复制代码

本帖被以下淘专辑推荐:

想知道小甲鱼最近在做啥?请访问 -> ilovefishc.com
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

小黑屋|手机版|Archiver|鱼C工作室 ( 粤ICP备18085999号-1 | 粤公网安备 44051102000585号)

GMT+8, 2024-4-28 15:35

Powered by Discuz! X3.4

© 2001-2023 Discuz! Team.

快速回复 返回顶部 返回列表