mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
212 lines
4.7 KiB
Python
212 lines
4.7 KiB
Python
{
|
|
"cells": [
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges)."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"# Solution Notebook"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Problem: Implement fibonacci recursively, dynamically, and iteratively.\n",
|
|
"\n",
|
|
"* [Constraints](#Constraints)\n",
|
|
"* [Test Cases](#Test-Cases)\n",
|
|
"* [Algorithm](#Algorithm)\n",
|
|
"* [Code](#Code)\n",
|
|
"* [Unit Test](#Unit-Test)"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Constraints\n",
|
|
"\n",
|
|
"* Does the sequence start at 0 or 1?\n",
|
|
" * 0\n",
|
|
"* Can we assume the inputs are valid non-negative ints?\n",
|
|
" * Yes\n",
|
|
"* Are you looking for a recursive or iterative solution?\n",
|
|
" * Either\n",
|
|
"* Can we assume this fits memory?\n",
|
|
" * Yes"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Test Cases\n",
|
|
"\n",
|
|
"* n = 0 -> 0\n",
|
|
"* n = 1 -> 1\n",
|
|
"* n = 6 -> 8\n",
|
|
"* Fib sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34..."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Algorithm\n",
|
|
"\n",
|
|
"Recursive:\n",
|
|
"* Fibonacci is as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34...\n",
|
|
"* If n = 0 or 1, return n\n",
|
|
"* Else return fib(n-1) + fib(n-2)\n",
|
|
"\n",
|
|
"Complexity:\n",
|
|
"* Time: O(2^n) if recursive or iterative, O(n) if dynamic\n",
|
|
"* Space: O(n) if recursive, O(1) if iterative, O(n) if dynamic"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Code"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": 1,
|
|
"metadata": {
|
|
"collapsed": true
|
|
},
|
|
"outputs": [],
|
|
"source": [
|
|
"class Math(object):\n",
|
|
"\n",
|
|
" def fib_iterative(self, n):\n",
|
|
" a = 0\n",
|
|
" b = 1\n",
|
|
" for _ in range(n):\n",
|
|
" a, b = b, a + b\n",
|
|
" return a\n",
|
|
"\n",
|
|
" def fib_recursive(self, n):\n",
|
|
" if n == 0 or n == 1:\n",
|
|
" return n\n",
|
|
" else:\n",
|
|
" return self.fib_recursive(n-1) + self.fib_recursive(n-2)\n",
|
|
"\n",
|
|
" def fib_dynamic(self, n):\n",
|
|
" cache = {}\n",
|
|
" return self._fib_dynamic(n, cache)\n",
|
|
"\n",
|
|
" def _fib_dynamic(self, n, cache):\n",
|
|
" if n == 0 or n == 1:\n",
|
|
" return n\n",
|
|
" if n in cache:\n",
|
|
" return cache[n]\n",
|
|
" cache[n] = self._fib_dynamic(n-1, cache) + self._fib_dynamic(n-2, cache)\n",
|
|
" return cache[n]"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"## Unit Test\n",
|
|
"\n"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": 2,
|
|
"metadata": {
|
|
"collapsed": false
|
|
},
|
|
"outputs": [
|
|
{
|
|
"name": "stdout",
|
|
"output_type": "stream",
|
|
"text": [
|
|
"Overwriting test_fibonacci.py\n"
|
|
]
|
|
}
|
|
],
|
|
"source": [
|
|
"%%writefile test_fibonacci.py\n",
|
|
"from nose.tools import assert_equal\n",
|
|
"\n",
|
|
"\n",
|
|
"class TestFib(object):\n",
|
|
"\n",
|
|
" def test_fib(self, func):\n",
|
|
" result = []\n",
|
|
" expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n",
|
|
" for i in range(len(expected)):\n",
|
|
" result.append(func(i))\n",
|
|
" assert_equal(result, expected)\n",
|
|
" print('Success: test_fib')\n",
|
|
"\n",
|
|
"\n",
|
|
"def main():\n",
|
|
" test = TestFib()\n",
|
|
" math = Math()\n",
|
|
" test.test_fib(math.fib_recursive)\n",
|
|
" test.test_fib(math.fib_dynamic)\n",
|
|
" test.test_fib(math.fib_iterative)\n",
|
|
"\n",
|
|
"\n",
|
|
"if __name__ == '__main__':\n",
|
|
" main()"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": 3,
|
|
"metadata": {
|
|
"collapsed": false
|
|
},
|
|
"outputs": [
|
|
{
|
|
"name": "stdout",
|
|
"output_type": "stream",
|
|
"text": [
|
|
"Success: test_fib\n",
|
|
"Success: test_fib\n",
|
|
"Success: test_fib\n"
|
|
]
|
|
}
|
|
],
|
|
"source": [
|
|
"%run -i test_fibonacci.py"
|
|
]
|
|
}
|
|
],
|
|
"metadata": {
|
|
"kernelspec": {
|
|
"display_name": "Python 3",
|
|
"language": "python",
|
|
"name": "python3"
|
|
},
|
|
"language_info": {
|
|
"codemirror_mode": {
|
|
"name": "ipython",
|
|
"version": 3
|
|
},
|
|
"file_extension": ".py",
|
|
"mimetype": "text/x-python",
|
|
"name": "python",
|
|
"nbconvert_exporter": "python",
|
|
"pygments_lexer": "ipython3",
|
|
"version": "3.5.0"
|
|
}
|
|
},
|
|
"nbformat": 4,
|
|
"nbformat_minor": 0
|
|
}
|