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

#273: Remove nose dependency for graphs_trees/ (#277)

Browse Source
This commit is contained in:
Donne Martin
2020-07-10 21:02:32 -04:00
committed by GitHub
parent 139e157250
commit abf7524c26
67 changed files with 860 additions and 1027 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
graphs_trees/tree_lca/test_lca.py
View File

@@ -1,7 +1,7 @@
from nose.tools import assert_equal
import unittest
class TestLowestCommonAncestor(object):
class TestLowestCommonAncestor(unittest.TestCase):
def test_lca(self):
node10 = Node(10)
@@ -26,13 +26,13 @@ class TestLowestCommonAncestor(object):
root = node10
node0 = Node(0)
binary_tree = BinaryTree()
assert_equal(binary_tree.lca(root, node0, node5), None)
assert_equal(binary_tree.lca(root, node5, node0), None)
assert_equal(binary_tree.lca(root, node1, node8), node3)
assert_equal(binary_tree.lca(root, node12, node8), node5)
assert_equal(binary_tree.lca(root, node12, node40), node10)
assert_equal(binary_tree.lca(root, node9, node20), node9)
assert_equal(binary_tree.lca(root, node3, node5), node5)
self.assertEqual(binary_tree.lca(root, node0, node5), None)
self.assertEqual(binary_tree.lca(root, node5, node0), None)
self.assertEqual(binary_tree.lca(root, node1, node8), node3)
self.assertEqual(binary_tree.lca(root, node12, node8), node5)
self.assertEqual(binary_tree.lca(root, node12, node40), node10)
self.assertEqual(binary_tree.lca(root, node9, node20), node9)
self.assertEqual(binary_tree.lca(root, node3, node5), node5)
print('Success: test_lca')
@@ -42,4 +42,4 @@ def main():
if __name__ == '__main__':
main()
main()

20
graphs_trees/tree_lca/tree_lca_challenge.ipynb
View File

@@ -136,10 +136,10 @@
"outputs": [],
"source": [
"# %load test_lca.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestLowestCommonAncestor(object):\n",
"class TestLowestCommonAncestor(unittest.TestCase):\n",
"\n",
" def test_lca(self):\n",
" node10 = Node(10)\n",
@@ -164,13 +164,13 @@
" root = node10\n",
" node0 = Node(0)\n",
" binary_tree = BinaryTree()\n",
" assert_equal(binary_tree.lca(root, node0, node5), None)\n",
" assert_equal(binary_tree.lca(root, node5, node0), None)\n",
" assert_equal(binary_tree.lca(root, node1, node8), node3)\n",
" assert_equal(binary_tree.lca(root, node12, node8), node5)\n",
" assert_equal(binary_tree.lca(root, node12, node40), node10)\n",
" assert_equal(binary_tree.lca(root, node9, node20), node9)\n",
" assert_equal(binary_tree.lca(root, node3, node5), node5)\n",
" self.assertEqual(binary_tree.lca(root, node0, node5), None)\n",
" self.assertEqual(binary_tree.lca(root, node5, node0), None)\n",
" self.assertEqual(binary_tree.lca(root, node1, node8), node3)\n",
" self.assertEqual(binary_tree.lca(root, node12, node8), node5)\n",
" self.assertEqual(binary_tree.lca(root, node12, node40), node10)\n",
" self.assertEqual(binary_tree.lca(root, node9, node20), node9)\n",
" self.assertEqual(binary_tree.lca(root, node3, node5), node5)\n",
" print('Success: test_lca')\n",
"\n",
"\n",
@@ -209,7 +209,7 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.6.4"
"version": "3.7.2"
}
},
"nbformat": 4,

42
graphs_trees/tree_lca/tree_lca_solution.ipynb
View File

@@ -96,9 +96,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"class Node(object):\n",
@@ -115,9 +113,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class BinaryTree(object):\n",
@@ -155,9 +151,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class LcaResult(object):\n",
@@ -209,9 +203,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -223,10 +215,10 @@
],
"source": [
"%%writefile test_lca.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestLowestCommonAncestor(object):\n",
"class TestLowestCommonAncestor(unittest.TestCase):\n",
"\n",
" def test_lca(self):\n",
" node10 = Node(10)\n",
@@ -251,13 +243,13 @@
" root = node10\n",
" node0 = Node(0)\n",
" binary_tree = BinaryTree()\n",
" assert_equal(binary_tree.lca(root, node0, node5), None)\n",
" assert_equal(binary_tree.lca(root, node5, node0), None)\n",
" assert_equal(binary_tree.lca(root, node1, node8), node3)\n",
" assert_equal(binary_tree.lca(root, node12, node8), node5)\n",
" assert_equal(binary_tree.lca(root, node12, node40), node10)\n",
" assert_equal(binary_tree.lca(root, node9, node20), node9)\n",
" assert_equal(binary_tree.lca(root, node3, node5), node5)\n",
" self.assertEqual(binary_tree.lca(root, node0, node5), None)\n",
" self.assertEqual(binary_tree.lca(root, node5, node0), None)\n",
" self.assertEqual(binary_tree.lca(root, node1, node8), node3)\n",
" self.assertEqual(binary_tree.lca(root, node12, node8), node5)\n",
" self.assertEqual(binary_tree.lca(root, node12, node40), node10)\n",
" self.assertEqual(binary_tree.lca(root, node9, node20), node9)\n",
" self.assertEqual(binary_tree.lca(root, node3, node5), node5)\n",
" print('Success: test_lca')\n",
"\n",
"\n",
@@ -273,9 +265,7 @@
{
"cell_type": "code",
"execution_count": 5,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -306,9 +296,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
}