From ea47ae2932b11f2b28c5e7276c8c42bfdeb46474 Mon Sep 17 00:00:00 2001 From: Jigyasa G Date: Thu, 10 Oct 2019 00:50:19 +0530 Subject: [PATCH] Adding missing Doctests (#1330) * Adding doctests in abbreviation * Adding doctests in fibonacci.py --- dynamic_programming/abbreviation.py | 12 ++++++++++-- dynamic_programming/fibonacci.py | 16 ++++++++++++++++ 2 files changed, 26 insertions(+), 2 deletions(-) diff --git a/dynamic_programming/abbreviation.py b/dynamic_programming/abbreviation.py index f4d07e402..a2aec35af 100644 --- a/dynamic_programming/abbreviation.py +++ b/dynamic_programming/abbreviation.py @@ -11,8 +11,13 @@ a=daBcd and b="ABC" daBcd -> capitalize a and c(dABCd) -> remove d (ABC) """ - def abbr(a, b): + """ + >>> abbr("daBcd", "ABC") + True + >>> abbr("dBcd", "ABC") + False + """ n = len(a) m = len(b) dp = [[False for _ in range(m + 1)] for _ in range(n + 1)] @@ -28,4 +33,7 @@ def abbr(a, b): if __name__ == "__main__": - print(abbr("daBcd", "ABC")) # expect True + # print(abbr("daBcd", "ABC")) # expect True + import doctest + + doctest.testmod() diff --git a/dynamic_programming/fibonacci.py b/dynamic_programming/fibonacci.py index 2dd1c2555..125686416 100644 --- a/dynamic_programming/fibonacci.py +++ b/dynamic_programming/fibonacci.py @@ -14,8 +14,20 @@ class Fibonacci: self.fib_array.append(self.fib_array[i - 1] + self.fib_array[i - 2]) elif N == 0: self.fib_array.append(0) + print(self.fib_array) def get(self, sequence_no=None): + """ + >>> Fibonacci(5).get(3) + [0, 1, 1, 2, 3, 5] + [0, 1, 1, 2] + >>> Fibonacci(5).get(6) + [0, 1, 1, 2, 3, 5] + Out of bound. + >>> Fibonacci(5).get(-1) + [0, 1, 1, 2, 3, 5] + [] + """ if sequence_no != None: if sequence_no < len(self.fib_array): return print(self.fib_array[: sequence_no + 1]) @@ -46,3 +58,7 @@ if __name__ == "__main__": print("\nInvalid input, please try again.") except NameError: print("\n********* Invalid input, good bye!! ************\n") + + import doctest + + doctest.testmod()