Fix LeetCode tests for 509. Fibonacci Number

Author: raul-sauco

README.md

@@ -85,10 +85,10 @@ Proposed solutions to some LeetCode problems. The first column links to the prob
 
 First column is the problem difficulty, in descending order, second links to the problem in the Codewars website, the last column links to solutions in this repository.
 
-| Level | Remote Link                                 | Local Link                                               |
-| ----- | ------------------------------------------- | -------------------------------------------------------- |
-| 6kyu  | [Convert string to camel case][cdw517abf8]] | [python](codewars/6-kyu-convert-string-to-camel-case.py) |
-| 6kyu  | [Who won the election?][cdw554910d]]        | [python](codewars/6-kyu-who-won-the-election.py)         |
+| Level | Remote Link                                | Local Link                                               |
+| ----- | ------------------------------------------ | -------------------------------------------------------- |
+| 6kyu  | [Convert string to camel case][cdw517abf8] | [python](codewars/6-kyu-convert-string-to-camel-case.py) |
+| 6kyu  | [Who won the election?][cdw554910d]        | [python](codewars/6-kyu-who-won-the-election.py)         |
 
 [cdw517abf8]: https://www.codewars.com/kata/517abf86da9663f1d2000003/train/python
 [cdw554910d]: https://www.codewars.com/kata/554910d77a3582bbe300009c/train/python

leetcode/fibonacci-number.py

@@ -1,27 +1,28 @@
 # https://leetcode.com/problems/fibonacci-number/
 
+import timeit
 
-# Solution using two variables
+
+# Solution using two variables. Tabular dynamic programming.
 #
 # Runtime: 48 ms, faster than 54.58% of Python3 online submissions for Fibonacci Number.
 # Memory Usage: 13.8 MB, less than 54.34 % of Python3 online submissions for Fibonacci Number.
 
-
-class Solution:
+class DPTabVar:
     def fib(self, n: int) -> int:
         if n < 2:
             return n
-        pp, p = 0, 1
-        for _ in range(2, n+1):
-            pp, p = p, p + pp
-        return p
+        a = b = 1
+        for _ in range(n-1):
+            a, b = b, a + b
+        return a
 
 
 # Math solution fails for large numbers, fib(200) is short by 1
 #
 # Runtime: 52 ms, faster than 47.02% of Python3 online submissions for Fibonacci Number.
 # Memory Usage: 13.9 MB, less than 54.34 % of Python3 online submissions for Fibonacci Number.
-class MathSolution:
+class Math:
     def fib(self, n: int) -> int:
         golden_ratio = (1 + 5 ** 0.5) / 2
         return int((golden_ratio ** n + 1) / 5 ** 0.5)
@@ -33,7 +34,7 @@ def fib(self, n: int) -> int:
 # Memory Usage: 13.7 MB, less than 95.58 % of Python3 online submissions for Fibonacci Number.
 
 
-class TSolution:
+class DPTab:
     def fib(self, n: int) -> int:
         f = [0 for _ in range(n + 2)]
         f[1] = 1
@@ -44,11 +45,25 @@ def fib(self, n: int) -> int:
 
 
 def test():
-    sol = Solution()
-    assert sol.fib(6) == 8
-    assert sol.fib(20) == 6765
-    assert sol.fib(50) == 12586269025
-    assert sol.fib(200) == 280571172992510140037611932413038677189525
+    executors = [DPTabVar,  DPTab, Math]
+    tests = [
+        [6, 8],
+        [20, 6765],
+        [50, 12586269025],
+        # [200, 280571172992510140037611932413038677189525],
+    ]
+    for executor in executors:
+        start = timeit.default_timer()
+        for _ in range(int(float('1'))):
+            for t in tests:
+                sol = executor()
+                result = sol.fib(t[0])
+                expected = t[1]
+                assert result == expected, f'{result} != {expected}'
+        stop = timeit.default_timer()
+        used = str(round(stop - start, 5))
+        res = "{0:20}{1:10}{2:10}".format(executor.__name__, used, "seconds")
+        print(f"\033[92m» {res}\033[0m")
 
 
 test()