Simple String Compression

Function Name: compressString

Description

You are tasked with writing a function that applies a basic form of string compression. The compression algorithm you should implement will take a string consisting solely of alphabetical characters and output a compressed version of the string. In the compressed version, sequences of repeated characters should be replaced by that character followed by an integer indicating how many times the character repeats consecutively. For instance, 'aaabcc' would be compressed to 'a3b1c2'. The function should only compress the string if it results in a smaller string than the input.

Requirements

• The function must be named 'compressString'.
• The function must take a single parameter - the input string to compress.
• The input string will only contain uppercase and lowercase alphabetical characters (A-Z, a-z).
• If the compressed string is not shorter than the original string, the function should return the original string.
• Sequences with only a single character should not have the number '1' added after them in the compressed version.

Examples

Example 1: compressString('aabccc') returns 'a2bc3'.Example 2: compressString('abc') returns 'abc' (since compressing does not reduce the size of the string).Example 3: compressString('zzzzzzzz') returns 'z8'.Example 4: compressString('aabba') returns 'a2b2a'.

Links