LeetCode75——Day9

文章目录

一、题目

443. String Compression

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.

二、题解

O(n)时间复杂度,O(1)空间复杂度的实现,和题解略有区别

cpp 复制代码
class Solution {
public:
    int compress(vector<char>& chars) {
        int n = chars.size();
        int index = 0, fast = 0;
        while(fast < n){
            char curChar = chars[fast];
            int curIndex = fast;
            while(fast < n && chars[fast] == curChar) fast++;
            int gap = fast - curIndex;
            if(gap == 1) chars[index++] = chars[curIndex];
            else{
                chars[index++] = chars[curIndex];
                string tmp = to_string(gap);
                for(int i = 0;i < tmp.length();i++) chars[index + i] = tmp[i];
                index += tmp.length();
            }
        }
        return index;
    }
};
相关推荐
风中的微尘3 小时前
39.网络流入门
开发语言·网络·c++·算法
混分巨兽龙某某4 小时前
基于Qt Creator的Serial Port串口调试助手项目(代码开源)
c++·qt creator·串口助手·serial port
西红柿维生素4 小时前
JVM相关总结
java·jvm·算法
小冯记录编程4 小时前
C++指针陷阱:高效背后的致命危险
开发语言·c++·visual studio
C_Liu_5 小时前
C++:类和对象(下)
开发语言·c++
coderxiaohan5 小时前
【C++】类和对象1
java·开发语言·c++
阿昭L5 小时前
MFC仿真
c++·mfc
ChillJavaGuy6 小时前
常见限流算法详解与对比
java·算法·限流算法
散1126 小时前
01数据结构-01背包问题
数据结构
sali-tec6 小时前
C# 基于halcon的视觉工作流-章34-环状测量
开发语言·图像处理·算法·计算机视觉·c#