GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-05 08:58:02 +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

22
recursion_dynamic/longest_inc_subseq/longest_inc_subseq_challenge.ipynb
View File

@@ -76,9 +76,7 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class Subsequence(object):\n",
@@ -105,24 +103,22 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_longest_increasing_subseq.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"import unittest\n",
"\n",
"\n",
"class TestLongestIncreasingSubseq(object):\n",
"class TestLongestIncreasingSubseq(unittest.TestCase):\n",
"\n",
" def test_longest_increasing_subseq(self):\n",
" subseq = Subsequence()\n",
" assert_raises(TypeError, subseq.longest_inc_subseq, None)\n",
" assert_equal(subseq.longest_inc_subseq([]), [])\n",
" self.assertRaises(TypeError, subseq.longest_inc_subseq, None)\n",
" self.assertEqual(subseq.longest_inc_subseq([]), [])\n",
" seq = [3, 4, -1, 0, 6, 2, 3]\n",
" expected = [-1, 0, 2, 3]\n",
" assert_equal(subseq.longest_inc_subseq(seq), expected)\n",
" self.assertEqual(subseq.longest_inc_subseq(seq), expected)\n",
" print('Success: test_longest_increasing_subseq')\n",
"\n",
"\n",
@@ -161,9 +157,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
}

26
recursion_dynamic/longest_inc_subseq/longest_inc_subseq_solution.ipynb
View File

@@ -105,9 +105,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"class Subsequence(object):\n",
@@ -149,9 +147,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -163,18 +159,18 @@
],
"source": [
"%%writefile test_longest_increasing_subseq.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"import unittest\n",
"\n",
"\n",
"class TestLongestIncreasingSubseq(object):\n",
"class TestLongestIncreasingSubseq(unittest.TestCase):\n",
"\n",
" def test_longest_increasing_subseq(self):\n",
" subseq = Subsequence()\n",
" assert_raises(TypeError, subseq.longest_inc_subseq, None)\n",
" assert_equal(subseq.longest_inc_subseq([]), [])\n",
" self.assertRaises(TypeError, subseq.longest_inc_subseq, None)\n",
" self.assertEqual(subseq.longest_inc_subseq([]), [])\n",
" seq = [3, 4, -1, 0, 6, 2, 3]\n",
" expected = [-1, 0, 2, 3]\n",
" assert_equal(subseq.longest_inc_subseq(seq), expected)\n",
" self.assertEqual(subseq.longest_inc_subseq(seq), expected)\n",
" print('Success: test_longest_increasing_subseq')\n",
"\n",
"\n",
@@ -190,9 +186,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -223,9 +217,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
}

12
recursion_dynamic/longest_inc_subseq/test_longest_increasing_subseq.py
View File

@@ -1,15 +1,15 @@
from nose.tools import assert_equal, assert_raises
import unittest
class TestLongestIncreasingSubseq(object):
class TestLongestIncreasingSubseq(unittest.TestCase):
def test_longest_increasing_subseq(self):
subseq = Subsequence()
assert_raises(TypeError, subseq.longest_inc_subseq, None)
assert_equal(subseq.longest_inc_subseq([]), [])
self.assertRaises(TypeError, subseq.longest_inc_subseq, None)
self.assertEqual(subseq.longest_inc_subseq([]), [])
seq = [3, 4, -1, 0, 6, 2, 3]
expected = [-1, 0, 2, 3]
assert_equal(subseq.longest_inc_subseq(seq), expected)
self.assertEqual(subseq.longest_inc_subseq(seq), expected)
print('Success: test_longest_increasing_subseq')
@@ -19,4 +19,4 @@ def main():
if __name__ == '__main__':
main()
main()