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

10
graphs_trees/min_heap/min_heap.py
View File

@@ -29,12 +29,12 @@ class MinHeap(object):
if key is None:
raise TypeError('key cannot be None')
self.array.append(key)
self._bubble_up(index=len(self.array)-1)
self._bubble_up(index=len(self.array) - 1)
def _bubble_up(self, index):
if index == 0:
return
index_parent = (index-1) // 2
index_parent = (index - 1) // 2
if self.array[index] < self.array[index_parent]:
# Swap the indices and recurse
self.array[index], self.array[index_parent] = \
@@ -54,13 +54,17 @@ class MinHeap(object):
def _find_smaller_child(self, index):
left_child_index = 2 * index + 1
right_child_index = 2 * index + 2
# No right child
if right_child_index >= len(self.array):
# No left child
if left_child_index >= len(self.array):
return -1
# Left child only
else:
return left_child_index
else:
# Compare left and right children
if self.array[left_child_index] < self.array[right_child_index]:
return left_child_index
else:
return right_child_index
return right_child_index

32
graphs_trees/min_heap/min_heap_challenge.ipynb
View File

@@ -95,9 +95,7 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class MinHeap(object):\n",
@@ -140,34 +138,32 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_min_heap.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestMinHeap(object):\n",
"class TestMinHeap(unittest.TestCase):\n",
"\n",
" def test_min_heap(self):\n",
" heap = MinHeap()\n",
" assert_equal(heap.peek_min(), None)\n",
" assert_equal(heap.extract_min(), None)\n",
" self.assertEqual(heap.peek_min(), None)\n",
" self.assertEqual(heap.extract_min(), None)\n",
" heap.insert(20)\n",
" assert_equal(heap.peek_min(), 20)\n",
" self.assertEqual(heap.peek_min(), 20)\n",
" heap.insert(5)\n",
" assert_equal(heap.peek_min(), 5)\n",
" self.assertEqual(heap.peek_min(), 5)\n",
" heap.insert(15)\n",
" heap.insert(22)\n",
" heap.insert(40)\n",
" heap.insert(5)\n",
" assert_equal(heap.peek_min(), 5)\n",
" self.assertEqual(heap.peek_min(), 5)\n",
" heap.insert(3)\n",
" assert_equal(heap.peek_min(), 3)\n",
" assert_equal(heap.extract_min(), 3)\n",
" assert_equal(heap.peek_min(), 5)\n",
" self.assertEqual(heap.peek_min(), 3)\n",
" self.assertEqual(heap.extract_min(), 3)\n",
" self.assertEqual(heap.peek_min(), 5)\n",
" print('Success: test_min_heap')\n",
"\n",
" \n",
@@ -206,9 +202,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
}

72
graphs_trees/min_heap/min_heap_solution.ipynb
View File

@@ -194,9 +194,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -283,9 +281,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"%run min_heap.py"
@@ -301,9 +297,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -315,46 +309,46 @@
],
"source": [
"%%writefile test_min_heap.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestMinHeap(object):\n",
"class TestMinHeap(unittest.TestCase):\n",
"\n",
" def test_min_heap(self):\n",
" heap = MinHeap()\n",
" assert_equal(heap.peek_min(), None)\n",
" assert_equal(heap.extract_min(), None)\n",
" self.assertEqual(heap.peek_min(), None)\n",
" self.assertEqual(heap.extract_min(), None)\n",
" heap.insert(20)\n",
" assert_equal(heap.array[0], 20)\n",
" self.assertEqual(heap.array[0], 20)\n",
" heap.insert(5)\n",
" assert_equal(heap.array[0], 5)\n",
" assert_equal(heap.array[1], 20)\n",
" self.assertEqual(heap.array[0], 5)\n",
" self.assertEqual(heap.array[1], 20)\n",
" heap.insert(15)\n",
" assert_equal(heap.array[0], 5)\n",
" assert_equal(heap.array[1], 20)\n",
" assert_equal(heap.array[2], 15)\n",
" self.assertEqual(heap.array[0], 5)\n",
" self.assertEqual(heap.array[1], 20)\n",
" self.assertEqual(heap.array[2], 15)\n",
" heap.insert(22)\n",
" assert_equal(heap.array[0], 5)\n",
" assert_equal(heap.array[1], 20)\n",
" assert_equal(heap.array[2], 15)\n",
" assert_equal(heap.array[3], 22)\n",
" self.assertEqual(heap.array[0], 5)\n",
" self.assertEqual(heap.array[1], 20)\n",
" self.assertEqual(heap.array[2], 15)\n",
" self.assertEqual(heap.array[3], 22)\n",
" heap.insert(40)\n",
" assert_equal(heap.array[0], 5)\n",
" assert_equal(heap.array[1], 20)\n",
" assert_equal(heap.array[2], 15)\n",
" assert_equal(heap.array[3], 22)\n",
" assert_equal(heap.array[4], 40)\n",
" self.assertEqual(heap.array[0], 5)\n",
" self.assertEqual(heap.array[1], 20)\n",
" self.assertEqual(heap.array[2], 15)\n",
" self.assertEqual(heap.array[3], 22)\n",
" self.assertEqual(heap.array[4], 40)\n",
" heap.insert(3)\n",
" assert_equal(heap.array[0], 3)\n",
" assert_equal(heap.array[1], 20)\n",
" assert_equal(heap.array[2], 5)\n",
" assert_equal(heap.array[3], 22)\n",
" assert_equal(heap.array[4], 40)\n",
" assert_equal(heap.array[5], 15)\n",
" self.assertEqual(heap.array[0], 3)\n",
" self.assertEqual(heap.array[1], 20)\n",
" self.assertEqual(heap.array[2], 5)\n",
" self.assertEqual(heap.array[3], 22)\n",
" self.assertEqual(heap.array[4], 40)\n",
" self.assertEqual(heap.array[5], 15)\n",
" mins = []\n",
" while heap:\n",
" mins.append(heap.extract_min())\n",
" assert_equal(mins, [3, 5, 15, 20, 22, 40])\n",
" self.assertEqual(mins, [3, 5, 15, 20, 22, 40])\n",
" print('Success: test_min_heap')\n",
"\n",
" \n",
@@ -370,9 +364,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -403,9 +395,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.4.3"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

54
graphs_trees/min_heap/test_min_heap.py
View File

@@ -1,43 +1,43 @@
from nose.tools import assert_equal
import unittest
class TestMinHeap(object):
class TestMinHeap(unittest.TestCase):
def test_min_heap(self):
heap = MinHeap()
assert_equal(heap.peek_min(), None)
assert_equal(heap.extract_min(), None)
self.assertEqual(heap.peek_min(), None)
self.assertEqual(heap.extract_min(), None)
heap.insert(20)
assert_equal(heap.array[0], 20)
self.assertEqual(heap.array[0], 20)
heap.insert(5)
assert_equal(heap.array[0], 5)
assert_equal(heap.array[1], 20)
self.assertEqual(heap.array[0], 5)
self.assertEqual(heap.array[1], 20)
heap.insert(15)
assert_equal(heap.array[0], 5)
assert_equal(heap.array[1], 20)
assert_equal(heap.array[2], 15)
self.assertEqual(heap.array[0], 5)
self.assertEqual(heap.array[1], 20)
self.assertEqual(heap.array[2], 15)
heap.insert(22)
assert_equal(heap.array[0], 5)
assert_equal(heap.array[1], 20)
assert_equal(heap.array[2], 15)
assert_equal(heap.array[3], 22)
self.assertEqual(heap.array[0], 5)
self.assertEqual(heap.array[1], 20)
self.assertEqual(heap.array[2], 15)
self.assertEqual(heap.array[3], 22)
heap.insert(40)
assert_equal(heap.array[0], 5)
assert_equal(heap.array[1], 20)
assert_equal(heap.array[2], 15)
assert_equal(heap.array[3], 22)
assert_equal(heap.array[4], 40)
self.assertEqual(heap.array[0], 5)
self.assertEqual(heap.array[1], 20)
self.assertEqual(heap.array[2], 15)
self.assertEqual(heap.array[3], 22)
self.assertEqual(heap.array[4], 40)
heap.insert(3)
assert_equal(heap.array[0], 3)
assert_equal(heap.array[1], 20)
assert_equal(heap.array[2], 5)
assert_equal(heap.array[3], 22)
assert_equal(heap.array[4], 40)
assert_equal(heap.array[5], 15)
self.assertEqual(heap.array[0], 3)
self.assertEqual(heap.array[1], 20)
self.assertEqual(heap.array[2], 5)
self.assertEqual(heap.array[3], 22)
self.assertEqual(heap.array[4], 40)
self.assertEqual(heap.array[5], 15)
mins = []
while heap:
mins.append(heap.extract_min())
assert_equal(mins, [3, 5, 15, 20, 22, 40])
self.assertEqual(mins, [3, 5, 15, 20, 22, 40])
print('Success: test_min_heap')
@@ -47,4 +47,4 @@ def main():
if __name__ == '__main__':
main()
main()