mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
Reworked notebook: Added more detail to constraints and test cases. Reworked algorithm discussion and unit test.
This commit is contained in:
parent
d16c1d2377
commit
78adc891be
|
@ -13,19 +13,23 @@
|
||||||
"source": [
|
"source": [
|
||||||
"## Problem: Implement the [Towers of Hanoi](http://en.wikipedia.org/wiki/Tower_of_Hanoi) with 3 towers and N disks.\n",
|
"## Problem: Implement the [Towers of Hanoi](http://en.wikipedia.org/wiki/Tower_of_Hanoi) with 3 towers and N disks.\n",
|
||||||
"\n",
|
"\n",
|
||||||
"* [Clarifying Questions](#Clarifying-Questions)\n",
|
"* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
|
||||||
"* [Test Cases](#Test-Cases)\n",
|
"* [Test Cases](#Test-Cases)\n",
|
||||||
"* [Algorithm](#Algorithm)\n",
|
"* [Algorithm](#Algorithm)\n",
|
||||||
"* [Code](#Code)"
|
"* [Code](#Code)\n",
|
||||||
|
"* [Unit Test](#Unit-Test)"
|
||||||
]
|
]
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"cell_type": "markdown",
|
"cell_type": "markdown",
|
||||||
"metadata": {},
|
"metadata": {},
|
||||||
"source": [
|
"source": [
|
||||||
"## Clarifying Questions\n",
|
"## Constraints and Assumptions\n",
|
||||||
"\n",
|
"\n",
|
||||||
"* None"
|
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||||
|
"\n",
|
||||||
|
"* Can we assume we already have a stack class that can be used for this problem?\n",
|
||||||
|
" * Yes"
|
||||||
]
|
]
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
|
@ -54,7 +58,7 @@
|
||||||
" * hanoi(n-1, buffer, dest) \n",
|
" * hanoi(n-1, buffer, dest) \n",
|
||||||
"\n",
|
"\n",
|
||||||
"Complexity:\n",
|
"Complexity:\n",
|
||||||
"* Time: O(2^n - 1)\n",
|
"* Time: O(2^n)\n",
|
||||||
"* Space: O(m) where m is the number of recursion levels"
|
"* Space: O(m) where m is the number of recursion levels"
|
||||||
]
|
]
|
||||||
},
|
},
|
||||||
|
@ -67,7 +71,7 @@
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"cell_type": "code",
|
"cell_type": "code",
|
||||||
"execution_count": null,
|
"execution_count": 1,
|
||||||
"metadata": {
|
"metadata": {
|
||||||
"collapsed": true
|
"collapsed": true
|
||||||
},
|
},
|
||||||
|
@ -78,7 +82,7 @@
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"cell_type": "code",
|
"cell_type": "code",
|
||||||
"execution_count": null,
|
"execution_count": 2,
|
||||||
"metadata": {
|
"metadata": {
|
||||||
"collapsed": false
|
"collapsed": false
|
||||||
},
|
},
|
||||||
|
@ -94,32 +98,68 @@
|
||||||
" hanoi(num_disks-1, buff, dest, src)"
|
" hanoi(num_disks-1, buff, dest, src)"
|
||||||
]
|
]
|
||||||
},
|
},
|
||||||
|
{
|
||||||
|
"cell_type": "markdown",
|
||||||
|
"metadata": {},
|
||||||
|
"source": [
|
||||||
|
"## Unit Test\n",
|
||||||
|
"\n",
|
||||||
|
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||||
|
]
|
||||||
|
},
|
||||||
{
|
{
|
||||||
"cell_type": "code",
|
"cell_type": "code",
|
||||||
"execution_count": null,
|
"execution_count": 3,
|
||||||
"metadata": {
|
"metadata": {
|
||||||
"collapsed": false
|
"collapsed": false
|
||||||
},
|
},
|
||||||
"outputs": [],
|
"outputs": [
|
||||||
|
{
|
||||||
|
"name": "stdout",
|
||||||
|
"output_type": "stream",
|
||||||
|
"text": [
|
||||||
|
"Test: NULL towers\n",
|
||||||
|
"Test: 0 disks\n",
|
||||||
|
"Test: 1 disk\n",
|
||||||
|
"Test: 2 or more disks\n",
|
||||||
|
"Success: test_hanoi\n"
|
||||||
|
]
|
||||||
|
}
|
||||||
|
],
|
||||||
"source": [
|
"source": [
|
||||||
"print('NULL towers')\n",
|
"from nose.tools import assert_equal\n",
|
||||||
"hanoi(num_disks, None, None, None)\n",
|
"\n",
|
||||||
"first = Stack()\n",
|
"class Test(object):\n",
|
||||||
"second = Stack()\n",
|
" def test_hanoi(self):\n",
|
||||||
"third = Stack()\n",
|
" num_disks = 3\n",
|
||||||
"print('0 disks')\n",
|
" src = Stack()\n",
|
||||||
"hanoi(num_disks, first, third, second)\n",
|
" buff = Stack()\n",
|
||||||
"print('1 disk')\n",
|
" dest = Stack()\n",
|
||||||
"first.push(5)\n",
|
"\n",
|
||||||
"hanoi(num_disks, first, third, second)\n",
|
" print('Test: NULL towers')\n",
|
||||||
"print(third.pop())\n",
|
" hanoi(num_disks, None, None, None)\n",
|
||||||
"print('2 or more disks')\n",
|
"\n",
|
||||||
"num_disks = 3\n",
|
" print('Test: 0 disks')\n",
|
||||||
"for i in xrange(num_disks, -1, -1):\n",
|
" hanoi(num_disks, src, dest, buff)\n",
|
||||||
" first.push(i)\n",
|
" assert_equal(dest.pop(), None)\n",
|
||||||
"hanoi(num_disks, first, third, second)\n",
|
"\n",
|
||||||
"for i in xrange(0, num_disks):\n",
|
" print('Test: 1 disk')\n",
|
||||||
" print(third.pop())"
|
" src.push(5)\n",
|
||||||
|
" hanoi(num_disks, src, dest, buff)\n",
|
||||||
|
" assert_equal(dest.pop(), 5)\n",
|
||||||
|
"\n",
|
||||||
|
" print('Test: 2 or more disks')\n",
|
||||||
|
" for i in xrange(num_disks, -1, -1):\n",
|
||||||
|
" src.push(i)\n",
|
||||||
|
" hanoi(num_disks, src, dest, buff)\n",
|
||||||
|
" for i in xrange(0, num_disks):\n",
|
||||||
|
" assert_equal(dest.pop(), i)\n",
|
||||||
|
"\n",
|
||||||
|
" print('Success: test_hanoi')\n",
|
||||||
|
"\n",
|
||||||
|
"if __name__ == '__main__':\n",
|
||||||
|
" test = Test()\n",
|
||||||
|
" test.test_hanoi()"
|
||||||
]
|
]
|
||||||
}
|
}
|
||||||
],
|
],
|
||||||
|
|
Loading…
Reference in New Issue
Block a user