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

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

Author: pre-commit-ci[bot]

dynamic_programming/bitmask.py

@@ -10,14 +10,15 @@
 
 from collections import defaultdict
 
+
 class AssignmentUsingBitmask:
     def __init__(self, task_performed, total):
         """
         Initialize the AssignmentUsingBitmask class.
 
         :param task_performed: A list of lists where each sublist contains the tasks that a person can perform.
         :param total: Total number of tasks.
-        
+
         >>> a = AssignmentUsingBitmask([[1, 3, 4], [1, 2, 5], [3, 4]], 5)
         >>> a.total_tasks
         5
@@ -28,7 +29,9 @@ def __init__(self, task_performed, total):
 
         # DP table will have a dimension of (2^M) x (N+1)
         # initially all values are set to -1
-        self.dp = [[-1 for _ in range(total + 1)] for _ in range(2 ** len(task_performed))]
+        self.dp = [
+            [-1 for _ in range(total + 1)] for _ in range(2 ** len(task_performed))
+        ]
 
         self.task = defaultdict(list)  # stores the list of persons for each task
 
@@ -42,7 +45,7 @@ def count_ways_until(self, mask, task_no):
         :param mask: Current mask representing which persons have been assigned tasks.
         :param task_no: The current task number being considered.
         :return: The number of ways to assign tasks starting from the current state.
-        
+
         >>> a = AssignmentUsingBitmask([[1, 3, 4], [1, 2, 5], [3, 4]], 5)
         >>> a.count_ways_until(0, 1)
         0
@@ -85,7 +88,7 @@ def count_no_of_ways(self, task_performed):
 
         :param task_performed: A list of lists where each sublist contains the tasks that a person can perform.
         :return: The total number of ways to distribute tasks.
-        
+
         >>> a = AssignmentUsingBitmask([[1, 3, 4], [1, 2, 5], [3, 4]], 5)
         >>> a.count_no_of_ways([[1, 3, 4], [1, 2, 5], [3, 4]])
         10
@@ -98,6 +101,7 @@ def count_no_of_ways(self, task_performed):
         # Call the function to fill the DP table, final answer is stored in dp[0][1]
         return self.count_ways_until(0, 1)
 
+
 if __name__ == "__main__":
     total_tasks = 5  # Total number of tasks (the value of N)