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

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

dynamic_programming/travelling_salesman.py

@@ -1,4 +1,4 @@
 import sys
 
 
 def tsp_dp(distances: list[list[float]]) -> tuple[float, list[int]]:
@@ -35,7 +35,7 @@
         if state in dp:
             return dp[state]
 
-        minimum = float('inf')
+        minimum = float("inf")
         min_next = -1
 
         for next_city in range(n):
@@ -60,7 +60,7 @@
     for _ in range(n - 1):
         next_pos = parent[(mask, pos)]
         path.append(next_pos)
-        mask |= (1 << next_pos)
+        mask |= 1 << next_pos
         pos = next_pos
 
     return optimal_cost, path