aboutsummaryrefslogtreecommitdiff
path: root/challenge-261/jeanluc2020/python/ch-2.py
diff options
context:
space:
mode:
authorThomas Köhler <jean-luc@picard.franken.de>2024-03-18 19:59:59 +0100
committerThomas Köhler <jean-luc@picard.franken.de>2024-03-18 19:59:59 +0100
commitc234896c4e9fbb7e68245b20d6982768eadcbc0c (patch)
tree063240b0b32b9fab1acf93b0a4ec66590d99460b /challenge-261/jeanluc2020/python/ch-2.py
parentb91a4623cd4c2b51f779f59b53310a0bd745f03f (diff)
downloadperlweeklychallenge-club-c234896c4e9fbb7e68245b20d6982768eadcbc0c.tar.gz
perlweeklychallenge-club-c234896c4e9fbb7e68245b20d6982768eadcbc0c.tar.bz2
perlweeklychallenge-club-c234896c4e9fbb7e68245b20d6982768eadcbc0c.zip
Add solution 261.
Signed-off-by: Thomas Köhler <jean-luc@picard.franken.de>
Diffstat (limited to 'challenge-261/jeanluc2020/python/ch-2.py')
-rwxr-xr-xchallenge-261/jeanluc2020/python/ch-2.py68
1 files changed, 68 insertions, 0 deletions
diff --git a/challenge-261/jeanluc2020/python/ch-2.py b/challenge-261/jeanluc2020/python/ch-2.py
new file mode 100755
index 0000000000..8acebd4043
--- /dev/null
+++ b/challenge-261/jeanluc2020/python/ch-2.py
@@ -0,0 +1,68 @@
+#!/usr/bin/python3
+# https://theweeklychallenge.org/blog/perl-weekly-challenge-261/#TASK2
+#
+# Task 2: Multiply by Two
+# =======================
+#
+# You are given an array of integers, @ints and an integer $start.
+#
+# Write a script to do the followings:
+#
+# a) Look for $start in the array @ints, if found multiply the number by 2
+# b) If not found stop the process otherwise repeat
+#
+# In the end return the final value.
+#
+## Example 1
+##
+## Input: @ints = (5,3,6,1,12) and $start = 3
+## Output: 24
+##
+## Step 1: 3 is in the array so 3 x 2 = 6
+## Step 2: 6 is in the array so 6 x 2 = 12
+## Step 3: 12 is in the array so 12 x 2 = 24
+##
+## 24 is not found in the array so return 24.
+#
+## Example 2
+##
+## Input: @ints = (1,2,4,3) and $start = 1
+## Output: 8
+##
+## Step 1: 1 is in the array so 1 x 2 = 2
+## Step 2: 2 is in the array so 2 x 2 = 4
+## Step 3: 4 is in the array so 4 x 2 = 8
+##
+## 8 is not found in the array so return 8.
+#
+## Example 3
+##
+## Input: @ints = (5,6,7) and $start = 2
+## Output: 2
+##
+## 2 is not found in the array so return 2.
+#
+############################################################
+##
+## discussion
+##
+############################################################
+#
+# Instead of walking the list for every round, we create a
+# hash with the list elements as keys, which makes the lookup
+# easier. The we just check in a loop whether the current value
+# is still there.
+
+def multiply_by_two(ints: list, start: int) -> None:
+ print("Input: (", ", ".join(str(x) for x in ints), "), ", start, sep="")
+ hash: dict = {}
+ for x in ints:
+ hash[x] = 1
+ while start in hash:
+ start *= 2
+ print(f"Output: {start}")
+
+multiply_by_two( [5,3,6,1,12], 3);
+multiply_by_two( [1,2,4,3], 1);
+multiply_by_two( [5,6,7], 2);
+