GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-08 10:28:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

#273: Remove nose dependency for recursion_dynamic/ (#280)

Browse Source
This commit is contained in:
Donne Martin
2020-07-13 21:26:50 -04:00
committed by GitHub
parent dce6b6aa67
commit 76cb6507fc
57 changed files with 548 additions and 751 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
recursion_dynamic/fibonacci/fibonacci_challenge.ipynb
View File

@@ -109,23 +109,21 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_fibonacci.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestFib(object):\n",
"class TestFib(unittest.TestCase):\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",
" self.assertEqual(result, expected)\n",
" print('Success: test_fib')\n",
"\n",
"\n",
@@ -167,9 +165,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

22
recursion_dynamic/fibonacci/fibonacci_solution.ipynb
View File

@@ -81,9 +81,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"class Math(object):\n",
@@ -125,9 +123,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -139,17 +135,17 @@
],
"source": [
"%%writefile test_fibonacci.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestFib(object):\n",
"class TestFib(unittest.TestCase):\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",
" self.assertEqual(result, expected)\n",
" print('Success: test_fib')\n",
"\n",
"\n",
@@ -168,9 +164,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -203,9 +197,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

8
recursion_dynamic/fibonacci/test_fibonacci.py
View File

@@ -1,14 +1,14 @@
from nose.tools import assert_equal
import unittest
class TestFib(object):
class TestFib(unittest.TestCase):
def test_fib(self, func):
result = []
expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
for i in range(len(expected)):
result.append(func(i))
assert_equal(result, expected)
self.assertEqual(result, expected)
print('Success: test_fib')
@@ -21,4 +21,4 @@ def main():
if __name__ == '__main__':
main()
main()