Skip to content

solution m3-003 #158

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

solution m3-003 #158

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions projects/003-remove-outliers/python/main.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
def min_max_remover(list_value, integer_value):
list_value_copy = list_value.copy()
list_value_copy.sort()
counter = 1

while counter <= integer_value:
list_value_copy.remove(max(list_value_copy))
list_value_copy.remove(min(list_value_copy))
counter += 1

return list_value_copy

list_elements = []

user_input = float((input('insert value (insert 0 to stop): ')))
while user_input != 0:
list_elements.append(user_input)
user_input = float((input('insert value (insert 0 to stop): ')))

n = int(input('insert a non-negative integer: '))

if len(list_elements) < (n*2):
print(f'number of values must be higher than {n*2}')

else:
print(f'Copied list with elements removed: {min_max_remover(list_elements, n)}')
print(f'Original list: {list_elements}')