mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added testcases

Browse Source
This commit is contained in:
Tejaswi Tyagi 2024-10-04 15:13:09 +00:00
parent c9a773dbb8
commit c30da6502b
1 changed files with 17 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
dynamic_programming/longest_arithmetic_subsequence.py
View File

@ -64,9 +64,21 @@ if __name__ == "__main__":
import doctest
doctest.testmod()
# Sample test case
nums = [3, 6, 9, 12]
expected_length = 4
result = longest_arithmetic_subsequence(nums)
print("Length of longest arithmetic subsequence:", result)
# test cases
test_cases = [
([3, 6, 9, 12], 4),
([3, 6, 9, 12, 15], 5),
([1, 7, 10, 13, 14, 19], 4),
([1, 2, 3, 4], 4),
([], 0),
([10], 1),
([9, 4, 7, 2, 10], 3),
([1, 2, 2, 2, 2, 5], 4),
]
for nums, expected_length in test_cases:
result = longest_arithmetic_subsequence(nums)
print(f"Test case {nums}: Expected {expected_length}, Got {result}")
assert result == expected_length, f"Test failed for input {nums}"