資料結構

We have implemented a method to perform basic string compression using the counts of repeated characters. For example, the string "aaabbbbcccc" would be "a3b4c5". Which of the following strings will have the best compression ratio, which length(compressed_string)/length(original_string) is the smallest.