From e0d527e20263a901e3ccd6b516e741a28f8f9368 Mon Sep 17 00:00:00 2001 From: Lothar Buchholz Date: Fri, 21 Feb 2020 00:34:07 +0100 Subject: [PATCH] =?UTF-8?q?=E2=80=9EREADME.md=E2=80=9C=20=C3=A4ndern?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index b111575..11ae94d 100644 --- a/README.md +++ b/README.md @@ -1,22 +1,22 @@ -#Run-Length-Encoding +# Run-Length-Encoding -##Goal +## Goal Starting with a digit, count how often this digit occurs in succession. Then repeat the same procedure for given number of `iterations`. In human terms this is like speaking out loud how often each digit appears consecutively. -###Input +### Input `iterations` - a numeric value how often the process is repeated -###Output +### Output A numeric value representing a stream of occurrences and digits. -###Constraints +### Constraints 1 <= `iterations` <= 10 -**Start value** = 0 +**Start value** = 1 -###Examples -Assuming the start value is `1` and `iteration` is 5: +### Examples +Assuming the start value is `0` (**attention:** value differs from real start value for demostraton purposes) and `iteration` is 5: 0\. iteration: `0` (reading: *one 1*) 1\. iteration: `10` (reading: *two 1s*) 2\. iteration: `1110` (reading: *one 2 and one 1*)