[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/fibonacci.py

@@ -16,32 +16,32 @@
 class Fibonacci:
     """
     Dynamic Programming implementation of Fibonacci sequence generator.
-    
+
     This class maintains a memoized sequence of Fibonacci numbers and can efficiently
     generate new numbers by building on previously calculated values.
-    
+
     Attributes:
         sequence (list[int]): Memoized Fibonacci sequence starting with [0, 1]
     """
-    
+
     def __init__(self) -> None:
         """Initialize the Fibonacci sequence with the first two numbers."""
         self.sequence = [0, 1]
-    
+
     def get(self, index: int) -> list[int]:
         """
         Get the first `index` Fibonacci numbers. If numbers don't exist in the sequence,
         calculate all missing numbers leading up to the required index.
-        
+
         Args:
             index (int): Number of Fibonacci numbers to return (must be non-negative)
-        
+
         Returns:
             list[int]: List containing the first `index` Fibonacci numbers
-        
+
         Raises:
             ValueError: If index is negative
-        
+
         Examples:
             >>> fib = Fibonacci()
             >>> fib.get(0)
@@ -58,7 +58,7 @@ def get(self, index: int) -> list[int]:
             [0]
             >>> fib.get(15)  # Test extending existing sequence
             [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377]
-            
+
             # Test edge cases
             >>> fib_new = Fibonacci()
             >>> fib_new.get(0)
@@ -67,7 +67,7 @@ def get(self, index: int) -> list[int]:
             [0]
             >>> fib_new.get(2)
             [0, 1]
-            
+
             # Test error handling
             >>> fib_error = Fibonacci()
             >>> fib_error.get(-1)
@@ -78,7 +78,7 @@ def get(self, index: int) -> list[int]:
             Traceback (most recent call last):
                 ...
             ValueError: Index must be non-negative, got -5
-            
+
             # Test large numbers
             >>> fib_large = Fibonacci()
             >>> result = fib_large.get(20)
@@ -88,7 +88,7 @@ def get(self, index: int) -> list[int]:
             4181
             >>> result[0], result[1], result[2]
             (0, 1, 1)
-            
+
             # Test sequence correctness
             >>> fib_test = Fibonacci()
             >>> seq = fib_test.get(8)
@@ -97,30 +97,30 @@ def get(self, index: int) -> list[int]:
         """
         if index < 0:
             raise ValueError(f"Index must be non-negative, got {index}")
-        
+
         if index == 0:
             return []
-        
+
         # Calculate missing numbers if needed
         if (difference := index - len(self.sequence)) > 0:
             for _ in range(difference):
                 self.sequence.append(self.sequence[-1] + self.sequence[-2])
-        
+
         return self.sequence[:index]
-    
+
     def get_nth(self, n: int) -> int:
         """
         Get the nth Fibonacci number (0-indexed).
-        
+
         Args:
             n (int): The index of the Fibonacci number to retrieve
-        
+
         Returns:
             int: The nth Fibonacci number
-        
+
         Raises:
             ValueError: If n is negative
-        
+
         Examples:
             >>> fib = Fibonacci()
             >>> fib.get_nth(0)
@@ -140,19 +140,19 @@ def get_nth(self, n: int) -> int:
         """
         if n < 0:
             raise ValueError(f"Index must be non-negative, got {n}")
-        
+
         # Extend sequence if needed
         if n >= len(self.sequence):
             difference = n - len(self.sequence) + 1
             for _ in range(difference):
                 self.sequence.append(self.sequence[-1] + self.sequence[-2])
-        
+
         return self.sequence[n]
-    
+
     def reset(self) -> None:
         """
         Reset the sequence to its initial state.
-        
+
         Examples:
             >>> fib = Fibonacci()
             >>> fib.get(10)
@@ -169,7 +169,7 @@ def reset(self) -> None:
 def main() -> None:
     """
     Interactive CLI for generating Fibonacci numbers.
-    
+
     Allows users to input indices and get the corresponding Fibonacci sequence.
     Supports commands: 'exit', 'quit', 'reset', 'help'
     """
@@ -178,13 +178,13 @@ def main() -> None:
         "Enter the index of the Fibonacci number you want to calculate\n"
         "Commands: 'exit'/'quit' to exit, 'reset' to clear cache, 'help' for help\n"
     )
-    
+
     fibonacci = Fibonacci()
-    
+
     while True:
         try:
             prompt: str = input(">> ").strip().lower()
-            
+
             if prompt in {"exit", "quit"}:
                 print("Goodbye!")
                 break
@@ -203,24 +203,24 @@ def main() -> None:
                 continue
             elif prompt == "":
                 continue
-            
+
             try:
                 index: int = int(prompt)
                 if index < 0:
                     print("Please enter a non-negative number.")
                     continue
-                
+
                 result = fibonacci.get(index)
                 if not result:
                     print("[]")
                 else:
                     print(f"First {index} Fibonacci numbers: {result}")
                     if index > 0:
                         print(f"The {index}th Fibonacci number is: {result[-1]}")
-                        
+
             except ValueError:
                 print("Invalid input. Enter a number or use 'help' for commands.")
-                
+
         except KeyboardInterrupt:
             print("\nGoodbye!")
             break
@@ -230,4 +230,4 @@ def main() -> None:
 
 
 if __name__ == "__main__":
-    main()
+    main()