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>

data_structures/binary_tree/binary_tree_traversals.py

@@ -105,7 +105,6 @@ def get_nodes_from_left_to_right(
         if not root:
             return
         if level == 1:
-
             output.append(root.data)
         elif level > 1:
             populate_output(root.left, level - 1)

data_structures/binary_tree/inorder_tree_traversal_2022.py

@@ -58,7 +58,6 @@ def inorder(node: None | BinaryTreeNode) -> list[int]:  # if node is None,return
 
 
 def make_tree() -> BinaryTreeNode | None:
-
     root = insert(None, 15)
     insert(root, 10)
     insert(root, 25)

data_structures/hashing/double_hash.py

@@ -24,7 +24,6 @@ class DoubleHash(HashTable):
         super().__init__(*args, **kwargs)
 
     def __hash_function_2(self, value, data):
-
         next_prime_gt = (
             next_prime(value % self.size_table)
             if not is_prime(value % self.size_table)

data_structures/hashing/hash_table.py

@@ -32,7 +32,6 @@ class HashTable:
         return key % self.size_table
 
     def _step_by_step(self, step_ord):
-
         print(f"step {step_ord}")
         print(list(range(len(self.values))))
         print(self.values)
@@ -53,7 +52,6 @@ class HashTable:
         new_key = self.hash_function(key + 1)
 
         while self.values[new_key] is not None and self.values[new_key] != key:
-
             if self.values.count(None) > 0:
                 new_key = self.hash_function(new_key + 1)
             else:

data_structures/heap/binomial_heap.py

@@ -174,7 +174,6 @@ class BinomialHeap:
                 i.left_tree_size == i.parent.left_tree_size
                 and i.left_tree_size != i.parent.parent.left_tree_size
             ):
-
                 # Neighbouring Nodes
                 previous_node = i.left
                 next_node = i.parent.parent
@@ -233,7 +232,6 @@ class BinomialHeap:
                 and self.bottom_root.left_tree_size
                 == self.bottom_root.parent.left_tree_size
             ):
-
                 # Next node
                 next_node = self.bottom_root.parent.parent
 

data_structures/heap/skew_heap.py

@@ -71,7 +71,6 @@ class SkewHeap(Generic[T]):
     """
 
     def __init__(self, data: Iterable[T] | None = ()) -> None:
-
         """
         >>> sh = SkewHeap([3, 1, 3, 7])
         >>> list(sh)

data_structures/linked_list/doubly_linked_list_two.py

@@ -80,7 +80,6 @@ class LinkedList:
         return None
 
     def set_head(self, node: Node) -> None:
-
         if self.head is None:
             self.head = node
             self.tail = node
@@ -143,7 +142,6 @@ class LinkedList:
         raise Exception("Node not found")
 
     def delete_value(self, value):
-
         if (node := self.get_node(value)) is not None:
             if node == self.head:
                 self.head = self.head.get_next()

data_structures/stacks/prefix_evaluation.py

@@ -36,7 +36,6 @@ def evaluate(expression):
 
     # iterate over the string in reverse order
     for c in expression.split()[::-1]:
-
         # push operand to stack
         if is_operand(c):
             stack.append(int(c))

data_structures/stacks/stack_with_doubly_linked_list.py

@@ -92,7 +92,6 @@ class Stack(Generic[T]):
 
 # Code execution starts here
 if __name__ == "__main__":
-
     # Start with the empty stack
     stack: Stack[int] = Stack()
 

data_structures/stacks/stock_span_problem.py

@@ -9,7 +9,6 @@ on the current day is less than or equal to its price on the given day.
 
 
 def calculation_span(price, s):
-
     n = len(price)
     # Create a stack and push index of fist element to it
     st = []
@@ -20,7 +19,6 @@ def calculation_span(price, s):
 
     # Calculate span values for rest of the elements
     for i in range(1, n):
-
         # Pop elements from stack while stack is not
         # empty and top of stack is smaller than price[i]
         while len(st) > 0 and price[st[0]] <= price[i]: