LWC 56:443. String Compression

LWC 56:443. String Compression

传送门:443. String Compression

Problem:

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.

Example 1:

Input: [“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: “aa” is replaced by “a2”. “bb” is replaced by “b2”. “ccc” is replaced by “c3”.

Example 2:

Input: [“a”] Output: Return 1, and the first 1 characters of the input array should be: [“a”] Explanation: Nothing is replaced.

Example 3:

Input: [“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: Since the character “a” does not repeat, it is not compressed. “bbbbbbbbbbbb” is replaced by “b12”. Notice each digit has it’s own entry in the array.

Note:

All characters have an ASCII value in [35, 126].

1 <= len(chars) <= 1000.

思路: 非常暴力,按顺序计数即可,遇到不同重新归零,记录上一回合信息。

代码如下:

    public int compress(char[] chars) {
        int n = chars.length;

        if (n == 0) return 0;
        StringBuilder sb = new StringBuilder();

        char p = chars[0];
        int cnt = 1;
        for (int i = 1; i < n; ++i) {
            if (chars[i] == p) {
                cnt ++;
            }
            else {
                if (cnt == 1) {
                    sb.append(p);
                }
                else {
                    sb.append(p + "" + cnt);
                }
                cnt = 1;
            }
            p = chars[i];
        }

        if (cnt == 1) {
            sb.append(p);
        }
        else {
            sb.append(p + "" + cnt);
        }

        for (int i = 0; i < sb.length(); ++i) {
            chars[i] = sb.charAt(i);
        }

        return sb.length();
    }

优化一下:

    public int compress(char[] chars) {
        int n = chars.length;

        if (n == 0) return 0;

        char p = chars[0];
        int cnt = 1;
        int tot = 0;

        for (int i = 1; i < n; ++i) {
            if (chars[i] == p) {
                cnt ++;
            }
            else {
                if (cnt == 1) {
                    chars[tot++] = p;
                }
                else {
                    chars[tot++] = p;
                    String num = String.valueOf(cnt);
                    for (int j = 0; j < num.length(); ++j) {
                        chars[tot++] = num.charAt(j);
                    }
                }
                cnt = 1;
            }
            p = chars[i];
        }

        if (cnt == 1) {
            chars[tot++] = p;
        }
        else {
            chars[tot++] = p;
            String num = String.valueOf(cnt);
            for (int j = 0; j < num.length(); ++j) {
                chars[tot++] = num.charAt(j);
            }
        }

        return tot;
    }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏算法修养

HDU 5876 大连网络赛 Sparse Graph

Sparse Graph Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262...

3136
来自专栏机器学习入门

LWC 56:718. Maximum Length of Repeated Subarray

LWC 56:718. Maximum Length of Repeated Subarray 传送门:718. Maximum Length of Repea...

1876
来自专栏数据结构与算法

BZOJ3262: 陌上花开(cdq分治)

第一行为N,K (1 <= N <= 100,000, 1 <= K <= 200,000 ), 分别表示花的数量和最大属性值。

932
来自专栏ml

hdu 4034 Graph (floyd的深入理解)

Graph Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Jav...

33711
来自专栏算法修养

Code Forces 149DColoring Brackets(区间DP)

 Coloring Brackets time limit per test 2 seconds memory limit per test 256...

2816
来自专栏xingoo, 一个梦想做发明家的程序员

HDOJ 1006

Tick and Tick Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327...

1839
来自专栏ml

hdu-------1081To The Max

To The Max Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K...

2656
来自专栏ml

hdu---(Tell me the area)(几何/三角形面积以及圆面积的一些知识)

Tell me the area Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/3...

3487
来自专栏小樱的经验随笔

Codeforces 839B Game of the Rows【贪心】

B. Game of the Rows time limit per test:1 second memory limit per test:256 megab...

3166
来自专栏算法修养

UESTC 485 Game(康托展开,bfs打表)

Game Time Limit: 4000/2000MS (Java/Others) Memory Limit: 65535/65535KB (Ja...

3135

扫码关注云+社区