leetcode 443. String Compression(字符串压缩)

问题描述:

  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?

这里写图片描述

Note:

  All characters have an ASCII value in [35, 126].
  1 <= len(chars) <= 1000.

代码:

class Solution {
    public int compress(char[] chars) {
        if(chars.length == 0) return 0; 

        int mark = 0;       
        int write = 0;
        for(int i = 0; i < chars.length; i++){
            if(i + 1 == chars.length || chars[i] != chars[i+1]){
                chars[write] = chars[mark];
                write++;
                if(mark < i){
                    for(char a : (""+(i-mark+1)).toCharArray())
                        chars[write++] = a;
                }
                mark = i + 1;
            }
        }        
        return write;
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值