mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-05 17:34:49 +08:00
pre-commit: Upgrade psf/black for stable style 2023 (#8110)
* pre-commit: Upgrade psf/black for stable style 2023 Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`. * https://github.com/psf/black/blob/main/CHANGES.md#2310 > This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style… Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit. I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
@ -2,7 +2,6 @@ import re
|
||||
|
||||
|
||||
def dna(dna: str) -> str:
|
||||
|
||||
"""
|
||||
https://en.wikipedia.org/wiki/DNA
|
||||
Returns the second side of a DNA strand
|
||||
|
@ -35,7 +35,6 @@ def hamming_distance(string1: str, string2: str) -> int:
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
||||
import doctest
|
||||
|
||||
doctest.testmod()
|
||||
|
@ -44,11 +44,9 @@ def levenshtein_distance(first_word: str, second_word: str) -> int:
|
||||
previous_row = list(range(len(second_word) + 1))
|
||||
|
||||
for i, c1 in enumerate(first_word):
|
||||
|
||||
current_row = [i + 1]
|
||||
|
||||
for j, c2 in enumerate(second_word):
|
||||
|
||||
# Calculate insertions, deletions and substitutions
|
||||
insertions = previous_row[j + 1] + 1
|
||||
deletions = current_row[j] + 1
|
||||
|
@ -29,7 +29,6 @@ def prefix_function(input_string: str) -> list:
|
||||
prefix_result = [0] * len(input_string)
|
||||
|
||||
for i in range(1, len(input_string)):
|
||||
|
||||
# use last results for better performance - dynamic programming
|
||||
j = prefix_result[i - 1]
|
||||
while j > 0 and input_string[i] != input_string[j]:
|
||||
|
@ -33,7 +33,6 @@ def text_justification(word: str, max_width: int) -> list:
|
||||
words = word.split()
|
||||
|
||||
def justify(line: list, width: int, max_width: int) -> str:
|
||||
|
||||
overall_spaces_count = max_width - width
|
||||
words_count = len(line)
|
||||
if len(line) == 1:
|
||||
|
Reference in New Issue
Block a user