algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 09:21:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix ruff (#11527)

Browse Source 
* updating DIRECTORY.md

* Fix ruff

* Fix

* Fix

* Fix

* Revert "Fix"

This reverts commit 5bc3bf342208dd707da02dea7173c059317b6bc6.

* find_max.py: noqa: PLR1730

---------

Co-authored-by: MaximSmolskiy <MaximSmolskiy@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Maxim Smolskiy
2024-08-25 18:33:11 +03:00
committed by GitHub
parent 48418280b1
commit e3fa014a5a
13 changed files with 22 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
maths/find_max.py
View File

@ -20,7 +20,7 @@ def find_max_iterative(nums: list[int | float]) -> int | float:
raise ValueError("find_max_iterative() arg is an empty sequence")
max_num = nums[0]
for x in nums:
if x > max_num:
if x > max_num: # noqa: PLR1730
max_num = x
return max_num

3
maths/special_numbers/bell_numbers.py
View File

@ -61,8 +61,7 @@ def _binomial_coefficient(total_elements: int, elements_to_choose: int) -> int:
if elements_to_choose in {0, total_elements}:
return 1
if elements_to_choose > total_elements - elements_to_choose:
elements_to_choose = total_elements - elements_to_choose
elements_to_choose = min(elements_to_choose, total_elements - elements_to_choose)
coefficient = 1
for i in range(elements_to_choose):