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

#273: Remove nose dependency for arrays_strings/ (#274)

Browse Source
This commit is contained in:
Donne Martin
2020-07-04 10:56:49 -04:00
committed by GitHub
parent 9678c5ee69
commit b598f474af
34 changed files with 399 additions and 481 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
arrays_strings/priority_queue/priority_queue.py
View File

@@ -38,4 +38,4 @@ class PriorityQueue(object):
if node.obj is obj:
node.key = new_key
return node
return None
return None

16
arrays_strings/priority_queue/priority_queue_challenge.ipynb
View File

@@ -137,20 +137,18 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"# %load test_priority_queue.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestPriorityQueue(object):\n",
"class TestPriorityQueue(unittest.TestCase):\n",
"\n",
" def test_priority_queue(self):\n",
" priority_queue = PriorityQueue()\n",
" assert_equal(priority_queue.extract_min(), None)\n",
" self.assertEqual(priority_queue.extract_min(), None)\n",
" priority_queue.insert(PriorityQueueNode('a', 20))\n",
" priority_queue.insert(PriorityQueueNode('b', 5))\n",
" priority_queue.insert(PriorityQueueNode('c', 15))\n",
@@ -162,7 +160,7 @@
" mins = []\n",
" while priority_queue.array:\n",
" mins.append(priority_queue.extract_min().key)\n",
" assert_equal(mins, [2, 5, 15, 19, 22, 40])\n",
" self.assertEqual(mins, [2, 5, 15, 19, 22, 40])\n",
" print('Success: test_min_heap')\n",
"\n",
"\n",
@@ -201,9 +199,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
}

28
arrays_strings/priority_queue/priority_queue_solution.ipynb
View File

@@ -108,9 +108,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -168,9 +166,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"%run priority_queue.py"
@@ -186,9 +182,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -200,14 +194,14 @@
],
"source": [
"%%writefile test_priority_queue.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestPriorityQueue(object):\n",
"class TestPriorityQueue(unittest.TestCase):\n",
"\n",
" def test_priority_queue(self):\n",
" priority_queue = PriorityQueue()\n",
" assert_equal(priority_queue.extract_min(), None)\n",
" self.assertEqual(priority_queue.extract_min(), None)\n",
" priority_queue.insert(PriorityQueueNode('a', 20))\n",
" priority_queue.insert(PriorityQueueNode('b', 5))\n",
" priority_queue.insert(PriorityQueueNode('c', 15))\n",
@@ -219,7 +213,7 @@
" mins = []\n",
" while priority_queue.array:\n",
" mins.append(priority_queue.extract_min().key)\n",
" assert_equal(mins, [2, 5, 15, 19, 22, 40])\n",
" self.assertEqual(mins, [2, 5, 15, 19, 22, 40])\n",
" print('Success: test_min_heap')\n",
"\n",
"\n",
@@ -235,9 +229,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -268,9 +260,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
}

10
arrays_strings/priority_queue/test_priority_queue.py
View File

@@ -1,11 +1,11 @@
from nose.tools import assert_equal
import unittest
class TestPriorityQueue(object):
class TestPriorityQueue(unittest.TestCase):
def test_priority_queue(self):
priority_queue = PriorityQueue()
assert_equal(priority_queue.extract_min(), None)
self.assertEqual(priority_queue.extract_min(), None)
priority_queue.insert(PriorityQueueNode('a', 20))
priority_queue.insert(PriorityQueueNode('b', 5))
priority_queue.insert(PriorityQueueNode('c', 15))
@@ -17,7 +17,7 @@ class TestPriorityQueue(object):
mins = []
while priority_queue.array:
mins.append(priority_queue.extract_min().key)
assert_equal(mins, [2, 5, 15, 19, 22, 40])
self.assertEqual(mins, [2, 5, 15, 19, 22, 40])
print('Success: test_min_heap')
@@ -27,4 +27,4 @@ def main():
if __name__ == '__main__':
main()
main()