Given a string, output the run length encoding of that string so that repeat letters are compressed to the character and count. Example: abcccddeeeeea => abc3d2e5a // test cases: a aaa aab abb


  • 0
    M

    Given a string, output the run length encoding of that string so that repeat letters are compressed to the character and count.
    Example:
    abcccddeeeeea => abc3d2e5a
    // test cases: a aaa aab abb


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.