Caeden
07e991d553
Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions ( #7062 )
...
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038 )
* refactor: Fix naming conventions (#7038 )
* Update arithmetic_analysis/lu_decomposition.py
Co-authored-by: Christian Clauss <cclauss@me.com>
* [pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
* refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038 )
* chore: Fix naming conventions in doctests (#7038 )
* fix: Temporarily disable project euler problem 104 (#7069 )
* chore: Fix naming conventions in doctests (#7038 )
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
2022-10-13 00:54:20 +02:00
imp
c1b15a86ba
[mypy] Fix type annotations for dynamic programming ( #4687 )
...
* Fix mypy error for knapsack.py
* Fix mypy error for longest_increasing_subsequence
* Fix mypy error for fractional_knapsack_2.py
2021-09-03 11:49:23 +02:00
Christian Clauss
9316e7c014
Set the Python file maximum line length to 88 characters ( #2122 )
...
* flake8 --max-line-length=88
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
2020-06-16 10:09:19 +02:00
Christian Clauss
bfcb95b297
Create codespell.yml ( #1698 )
...
* fixup! Format Python code with psf/black push
* Create codespell.yml
* fixup! Format Python code with psf/black push
2020-01-18 13:24:33 +01:00
GeorgeChambi
9eb50cc223
Improved readability ( #1615 )
...
* improved readability
* further readability improvements
* removed csv file and added f
2019-12-07 06:39:59 +01:00
William Zhang
9eac17a408
psf/black code formatting ( #1277 )
2019-10-05 10:14:13 +05:00
Maxwell Aladago
5d46a4dd7b
ENH: Added a functionality to make it possible to reconstruct an optimal subset for the dynamic programming problem ( #1139 )
...
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* some pep8 cleanup too
2019-08-19 07:39:39 +02:00
bharath-123
bd7054ace9
updated testcase
...
Changed name to __name__. Sorry for the typo!
2018-07-23 13:01:02 +05:30
bharath-123
a9f9062080
Added code for memory function implementation
...
Added a function which implements knapsack using memory functions. Also I updated the test cases to include test cases for the memory function implementation.
2018-07-23 00:36:53 +05:30
dhruvsaini
5a3059784f
Create knapsack.py
...
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.
2017-01-03 16:50:13 +05:30
