Skip to content

Js 20 second largest #52

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

Closed
Klikasoft wants to merge 5 commits into from
Closed

Js 20 second largest #52

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
0df5f0f
GITIGNORE edit
Klikasoft Mar 31, 2025
ca55df7
20 druhe nejvetsi
Klikasoft Mar 31, 2025
fb340c5
Delete .gitignore
Klikasoft Apr 1, 2025
831f0d1
20 druhe nejvetsi
Klikasoft Mar 31, 2025
413ed5d
Merge branch 'js-20-second-largest' of https://github.com/Jimy-42/pyt…
Klikasoft Apr 3, 2025
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
174 changes: 0 additions & 174 deletions .gitignore
View file
Open in desktop

This file was deleted.

6 changes: 6 additions & 0 deletions 06/tasks/task_20_second_largest.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,4 +4,10 @@ def second_largest(lst: list[int]) -> int:
"""
Vrátí druhé největší číslo v seznamu.
"""
lst = sorted(lst, reverse=True)
for finder in lst:
if finder < lst[0]:
numero = finder
break
Comment on lines +8 to +11
Copy link
Contributor

@ZelenyMartin ZelenyMartin Apr 2, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Když už ten seznam řadíš, tak už nepotřebuješ žádný for ani if.

Copy link
Contributor Author

@Klikasoft Klikasoft Apr 2, 2025 •
edited
Loading

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ten for a if jsem tam dal pro pripad, ze by seznam obsahoval duplicity, mel jsem najít druhe nejvetsi cislo, sorted by mi je jen seradil, ale v pripade [10,12,12,12,11,11] bych druhe nejvetsi nenasel, pouhým lst[1] ale uznávám, že se to jistě dalo napsat i líp :)


return numero