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;
    }
};
相关推荐
owCode1 小时前
3-C++中类大小影响因素
开发语言·c++
C嘎嘎嵌入式开发1 小时前
【机器学习算法篇】K-近邻算法
算法·机器学习·近邻算法
小L~~~1 小时前
2025吉比特-游戏引擎开发-一面复盘
数据结构·算法·游戏引擎
程序猿Eason2 小时前
U587038 背包 题解
c++·算法·动态规划
爱吃芒果的蘑菇2 小时前
C++之WebSocket初体验
网络·c++·websocket·网络协议
Tipriest_2 小时前
C++ 中 using 的使用方法详解
c++·using
potato_may2 小时前
第18讲:C语言内存函数
c语言·数据结构·算法
顾晨阳——2 小时前
C/C++字符串
c语言·c++·字符串
深耕AI2 小时前
【MFC实用技巧】对话框“边框”属性四大选项:None、Thin、Resizing、对话框外框,到底怎么选?
c++·mfc