theoludwig/programming-challenges
1
1
Fork 0
mirror of https://github.com/theoludwig/programming-challenges.git synced 2025-05-18 12:02:53 +02:00
Code Issues Releases Activity

feat(solutions): add find-closest-number/python/function

Browse Source
This commit is contained in:
Divlo
2022-05-01 19:07:49 +02:00
parent 4e7cad4a70
commit 530f433028
4 changed files with 22 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
challenges/offset-arrays/solutions/python/function/solution.py
View File

@ -53,7 +53,7 @@ operations_index = int(nested[last_operation_index])
current_value = None
for index in range(len(operation_identifiers) - 1, -1, -1):
current_identifier = operation_identifiers[index]
if current_value == None:
if current_value is None:
current_value = assignments[current_identifier].get_by_index(
operations_index)
else: