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

Enable ruff ARG001 rule (#11321)

Browse Source 
* Enable ruff ARG001 rule

* Fix dynamic_programming/combination_sum_iv.py

* Fix machine_learning/frequent_pattern_growth.py

* Fix other/davis_putnam_logemann_loveland.py

* Fix other/password.py

* Fix

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix physics/n_body_simulation.py

* Fix project_euler/problem_145/sol1.py

* Fix project_euler/problem_174/sol1.py

* Fix scheduling/highest_response_ratio_next.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix

* Fix

* Fix scheduling/job_sequencing_with_deadline.py

* Fix scheduling/job_sequencing_with_deadline.py

* Fix

* Fix

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Maxim Smolskiy
2024-03-20 17:00:17 +03:00
committed by GitHub
parent 8faf823e83
commit a936e94704
11 changed files with 22 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
dynamic_programming/combination_sum_iv.py
View File

@ -22,12 +22,12 @@ of chosen elements is “tar”. For every element, we have two choices
"""
def combination_sum_iv(n: int, array: list[int], target: int) -> int:
def combination_sum_iv(array: list[int], target: int) -> int:
"""
Function checks the all possible combinations, and returns the count
of possible combination in exponential Time Complexity.
>>> combination_sum_iv(3, [1,2,5], 5)
>>> combination_sum_iv([1,2,5], 5)
9
"""
@ -41,13 +41,13 @@ def combination_sum_iv(n: int, array: list[int], target: int) -> int:
return count_of_possible_combinations(target)
def combination_sum_iv_dp_array(n: int, array: list[int], target: int) -> int:
def combination_sum_iv_dp_array(array: list[int], target: int) -> int:
"""
Function checks the all possible combinations, and returns the count
of possible combination in O(N^2) Time Complexity as we are using Dynamic
programming array here.
>>> combination_sum_iv_dp_array(3, [1,2,5], 5)
>>> combination_sum_iv_dp_array([1,2,5], 5)
9
"""
@ -96,7 +96,6 @@ if __name__ == "__main__":
import doctest
doctest.testmod()
n = 3
target = 5
array = [1, 2, 5]
print(combination_sum_iv(n, array, target))
print(combination_sum_iv(array, target))