Question

Python File Compression: Write a function called “compressString” which compresses a string such that any consecutive repeated characters are replaced with one of the character and the number of times the character is repeated. This is also known as "Run length encoding". Examples:“aaabbc” -> “a3b2c”“abc” -> “abc”“aaqakkaccc” -> a2qak2a2c3

Answer 1

def compressString(text):

    # Variable to hold the result
    # Add first character of given string to resultantString
    resultantString=text[0]

    # Counter variable to keep the track of how many times a character is repeated
    # Set count =1, because a character will always appears at least 1 time
    count=1

    # Iterate the loop till the length of given string - 1
    # because it will be compared in if statement
    for i in range(0,len(text)-1):

        # Check if adjacent characters are same
        # If yes, increment count
        # Keep incrementing count, till a character is repeated
        if text[i]==text[i+1] :
            count+=1
        else:
            # Else, check if count > 1
            # If yes, append value of count to resultant string
            if count>1 :
                resultantString+=str(count)

            # Append next to resultant string as well
            resultantString+=text[i+1]
            # Re-set count to 1
            count = 1
    # Now, the count for the last characters have been calculated
    # Check if it's > 1, if yes, append to resultant string
    if count> 1:
        resultantString+=str(count)

    # return resultant string
    return resultantString

if __name__ == '__main__':
    print ('aaabbc - ',compressString('aaabbc'))
    print('abc - ',compressString('abc'))
    print('aaqakkaccc - ',compressString('aaqakkaccc'))

SCREENSHOT-

汤compressString.py A def copressstring(text): # variable to hold the result # Add first character of given string to resultantString resultantString text [0] # Counter variable to keep the track of how many times a character is repeated # Set count -l, because a character will always appears at least 1 time count l 10 # Iterate the loop till the length of given string- 1 # because it will be compared in if statement for i in range (,len (text)-1) 12 13 15 16 17 I8 19 20 21 # Check If adjacent characters are same # If yes, increment count # Keep incrementing count, till a character is repeated if text [1]=text[i+1] : count+1 else: # Else, check if count > 1 # If yes, append value of count to resultant strin if count>l: 23 24 25 26 27 28 29 30 31 resultantString+ str(count) # Append next to resultant string as vell resultantStringt-text [i+1] # Re-set count to 1 count-1 # Now, the count for the last characters have been calculated # Check if it's > 1, if yes, append to resultant string

32 if count 1 resultantStringtstr (count) 34 35 36 37 # return resultant string return resultantString 38if namemain ': T: 39 40 41 print ('aaabbcmpressString ('aaabbc')) print('abccompressString ('abc')) print ('aagakkaccc copressString ('aagakkaccc))

OUTPUT-

compressString C:Users\mahes\AppData Local\Programsv aaabbca3b2c abcabc aaakkaccc a2qak2ac3 Process finished with exit code 0 IT