Data compression using long common strings

On typical English text, our method provides little compression; there are few long common strings to be exploited.
Some files, though, do contain repeated long strings.
Baker [1995] documented significant repetition in the code of large software systems.

Implement a method to perform basic string compression using the counts of repeated characters.
For example, the string aabcaaa would become a2b1c5a3.
If the "compressed" string would not become smaller than the original string, your method should return the original string.
The method signature is:

1. “public static String compress (String inpu…

Therefore, if we can take some files and compress them, we have to have some files that length under compression, to balance out the ones that shorten.
This means that a compression algorithm can only compress certain files, and it actually has to lengthen some.

The String is one of the most common primitive datatypes we all use today.
The data files are largely comprised of strings of data thus string data compression proves to be highly beneficial.
It can significantly reduce the size of files and speed up the file transfer rate saving significant time and resources.

However, the string-to-string correction problem does not capture the full generality of the delta compression problem

On typical English text, our method provides little compression; there are few long common strings to be exploited

Some files, though, do contain repeated long strings

Baker [1995] documented significant repetition in the code of large software systems

For example, there may be many versions of a document, say a Wikipedia article, that differ only slightly from one to the next

Delta compression techniques attempt to exploit such redundancy between pairs or groups of files to achieve better compression

We define delta compression for the most common case of a single reference file