compress-string-lcci

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

本书是原谷歌资深面试官的经验之作，帮助了许多想要加入脸书、苹果、谷歌等 IT 名企的求职者拿到 Dream offer。本专题的 100+ 编程面试题是在原书基础上精心挑选出来的，帮助你轻松应战 IT 名企技术面试。

英文版：Cracking the Coding Interview，源自硅谷程序员的面试红宝书

LCCI

Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the &quot;compressed&quot; string would not become smaller than the original string, your method should return the original string. You can assume the string has only uppercase and lowercase letters (a - z).

Example 1:

<pre>
Input: &quot;aabcccccaaa&quot;
Output: &quot;a2b1c5a3&quot;
</pre>

Example 2:

<pre>
Input: &quot;abbccd&quot;
Output: &quot;abbccd&quot;
Explanation: 
The compressed string is &quot;a1b2c2d1&quot;, which is longer than the original string.
</pre>

&nbsp;

Note:

<ol>
	<li><code>0 &lt;= S.length &lt;= 50000</code></li>
</ol>

compressString

Compress String LCCI

Two Pointers

String

字符串压缩。利用字符重复出现的次数，编写一种方法，实现基本的字符串压缩功能。比如，字符串<code>aabcccccaaa</code>会变为<code>a2b1c5a3</code>。若“压缩”后的字符串没有变短，则返回原先的字符串。你可以假设字符串中只包含大小写英文字母（a至z）。

示例 1：

<pre>
输入："aabcccccaaa"
输出："a2b1c5a3"
</pre>

示例 2：

<pre>
输入："abbccd"
输出："abbccd"
解释："abbccd"压缩后为"a1b2c2d1"，比原字符串长度更长。
</pre>

提示：

<ol>
	<li>字符串长度在 <code>[0, 50000]</code> 范围内。</li>
</ol>