From fa1633bfe61fd048cdff5da86be3f72aaf5e2bbb Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Thu, 3 Oct 2024 17:54:17 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 dynamic_programming/longest_arithmetic_subsequence.py | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/dynamic_programming/longest_arithmetic_subsequence.py b/dynamic_programming/longest_arithmetic_subsequence.py
index 4a19af504..bfe24fc4a 100644
--- a/dynamic_programming/longest_arithmetic_subsequence.py
+++ b/dynamic_programming/longest_arithmetic_subsequence.py
@@ -7,6 +7,7 @@ Note that:
 - A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value (for 0 <= i < seq.length - 1).
 """
 
+
 def longest_arithmetic_subsequence(nums: list[int]) -> int:
     """
     Finds the length of the longest arithmetic subsequence in a given array of integers.
@@ -38,7 +39,7 @@ def longest_arithmetic_subsequence(nums: list[int]) -> int:
     """
     if nums is None:
         raise ValueError("Input array cannot be None")
-    
+
     if len(nums) == 0:
         return 0
 
@@ -59,6 +60,7 @@ def longest_arithmetic_subsequence(nums: list[int]) -> int:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()
     # sample test case
     nums = [3, 6, 9, 12]