La richiesta
“Create a run-length encoding flowchart: initialize i and an empty result, read the current character, count matching consecutive characters, append the count and character, advance i, and return the result when the string ends.”
Prova alloraAdd an example input of AAABB.Change the result step to write to a file.
Cosa contiene questo disegno
Leggi le decisioni che ne stanno alla base.
01
Choose index-based counting vs. pointer-based
02Decide output format
count+char
03
Handle empty input gracefully
When implementing basic lossless compression for text or binary data with repeated runs, such as in educational exercises or file compression introductions.