mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-22 21:57:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] pre-commit autoupdate (#12680)

Browse Source 
* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.11.5 → v0.11.6](https://github.com/astral-sh/ruff-pre-commit/compare/v0.11.5...v0.11.6)

* updating DIRECTORY.md

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: pre-commit-ci[bot] <pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
pre-commit-ci[bot] 2025-04-21 19:54:11 +02:00 committed by GitHub
parent a1aa6313e0
commit 9891d2bc30
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
2 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.pre-commit-config.yaml
View File

@ -16,7 +16,7 @@ repos:
- id: auto-walrus - id: auto-walrus
- repo: https://github.com/astral-sh/ruff-pre-commit - repo: https://github.com/astral-sh/ruff-pre-commit
rev: v0.11.5 rev: v0.11.6
hooks: hooks:
- id: ruff - id: ruff
- id: ruff-format - id: ruff-format

7
DIRECTORY.md
View File

@ -40,6 +40,7 @@
* [Count Number Of One Bits](bit_manipulation/count_number_of_one_bits.py) * [Count Number Of One Bits](bit_manipulation/count_number_of_one_bits.py)
* [Excess 3 Code](bit_manipulation/excess_3_code.py) * [Excess 3 Code](bit_manipulation/excess_3_code.py)
* [Find Previous Power Of Two](bit_manipulation/find_previous_power_of_two.py) * [Find Previous Power Of Two](bit_manipulation/find_previous_power_of_two.py)
* [Find Unique Number](bit_manipulation/find_unique_number.py)
* [Gray Code Sequence](bit_manipulation/gray_code_sequence.py) * [Gray Code Sequence](bit_manipulation/gray_code_sequence.py)
* [Highest Set Bit](bit_manipulation/highest_set_bit.py) * [Highest Set Bit](bit_manipulation/highest_set_bit.py)
* [Index Of Rightmost Set Bit](bit_manipulation/index_of_rightmost_set_bit.py) * [Index Of Rightmost Set Bit](bit_manipulation/index_of_rightmost_set_bit.py)
@ -442,6 +443,7 @@
* [Present Value](financial/present_value.py) * [Present Value](financial/present_value.py)
* [Price Plus Tax](financial/price_plus_tax.py) * [Price Plus Tax](financial/price_plus_tax.py)
* [Simple Moving Average](financial/simple_moving_average.py) * [Simple Moving Average](financial/simple_moving_average.py)
* [Time And Half Pay](financial/time_and_half_pay.py)
## Fractals ## Fractals
* [Julia Sets](fractals/julia_sets.py) * [Julia Sets](fractals/julia_sets.py)
@ -570,6 +572,7 @@
* [Gaussian Elimination](linear_algebra/gaussian_elimination.py) * [Gaussian Elimination](linear_algebra/gaussian_elimination.py)
* [Jacobi Iteration Method](linear_algebra/jacobi_iteration_method.py) * [Jacobi Iteration Method](linear_algebra/jacobi_iteration_method.py)
* [Lu Decomposition](linear_algebra/lu_decomposition.py) * [Lu Decomposition](linear_algebra/lu_decomposition.py)
* [Matrix Inversion](linear_algebra/matrix_inversion.py)
* Src * Src
* [Conjugate Gradient](linear_algebra/src/conjugate_gradient.py) * [Conjugate Gradient](linear_algebra/src/conjugate_gradient.py)
* [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting.py) * [Gaussian Elimination Pivoting](linear_algebra/src/gaussian_elimination_pivoting.py)
@ -1153,6 +1156,8 @@
* [Sol1](project_euler/problem_120/sol1.py) * [Sol1](project_euler/problem_120/sol1.py)
* Problem 121 * Problem 121
* [Sol1](project_euler/problem_121/sol1.py) * [Sol1](project_euler/problem_121/sol1.py)
* Problem 122
* [Sol1](project_euler/problem_122/sol1.py)
* Problem 123 * Problem 123
* [Sol1](project_euler/problem_123/sol1.py) * [Sol1](project_euler/problem_123/sol1.py)
* Problem 125 * Problem 125
@ -1163,6 +1168,8 @@
* [Sol1](project_euler/problem_131/sol1.py) * [Sol1](project_euler/problem_131/sol1.py)
* Problem 135 * Problem 135
* [Sol1](project_euler/problem_135/sol1.py) * [Sol1](project_euler/problem_135/sol1.py)
* Problem 136
* [Sol1](project_euler/problem_136/sol1.py)
* Problem 144 * Problem 144
* [Sol1](project_euler/problem_144/sol1.py) * [Sol1](project_euler/problem_144/sol1.py)
* Problem 145 * Problem 145