2015-05-21 05:20:49 +08:00
{
"cells": [
2015-06-18 04:39:43 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
2015-07-05 19:59:00 +08:00
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges).</i></small>"
2015-07-03 11:03:04 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Solution Notebook"
2015-06-18 04:39:43 +08:00
]
},
2015-05-21 05:20:49 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Implement the [Towers of Hanoi](http://en.wikipedia.org/wiki/Tower_of_Hanoi) with 3 towers and N disks.\n",
"\n",
2015-06-30 17:55:58 +08:00
"* [Constraints](#Constraints)\n",
2015-05-21 05:20:49 +08:00
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
2015-06-27 18:31:30 +08:00
"* [Code](#Code)\n",
"* [Unit Test](#Unit-Test)"
2015-05-21 05:20:49 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
2015-06-28 19:13:27 +08:00
"## Constraints\n",
2015-05-21 05:20:49 +08:00
"\n",
2015-07-03 11:03:04 +08:00
"*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
2015-06-27 18:31:30 +08:00
"\n",
"* Can we assume we already have a stack class that can be used for this problem?\n",
" * Yes"
2015-05-21 05:20:49 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Test Cases\n",
"\n",
2015-07-03 11:03:04 +08:00
"* NULL tower(s)\n",
2015-05-21 05:20:49 +08:00
"* 0 disks\n",
"* 1 disk\n",
"* 2 or more disks"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Algorithm\n",
"\n",
"* Create three stacks to represent each tower\n",
"* def hanoi(n, src, dest, buffer):\n",
" * If 0 disks return\n",
" * hanoi(n-1, src, buffer)\n",
" * Move remaining element from src to dest\n",
" * hanoi(n-1, buffer, dest) \n",
"\n",
"Complexity:\n",
2015-06-27 18:31:30 +08:00
"* Time: O(2^n)\n",
2015-05-21 05:20:49 +08:00
"* Space: O(m) where m is the number of recursion levels"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Code"
]
},
{
"cell_type": "code",
2015-06-27 18:31:30 +08:00
"execution_count": 1,
2015-05-21 05:20:49 +08:00
"metadata": {
2015-07-03 11:03:04 +08:00
"collapsed": false
2015-05-21 05:20:49 +08:00
},
"outputs": [],
"source": [
2015-07-03 11:03:04 +08:00
"%run ../stack/stack.py"
2015-05-21 05:20:49 +08:00
]
},
{
"cell_type": "code",
2015-06-27 18:31:30 +08:00
"execution_count": 2,
2015-05-21 05:20:49 +08:00
"metadata": {
"collapsed": false
},
"outputs": [],
"source": [
"def hanoi(num_disks, src, dest, buff):\n",
" if src is None or dest is None or buff is None:\n",
" return\n",
" if num_disks > 0:\n",
" hanoi(num_disks-1, src, buff, dest)\n",
" data = src.pop()\n",
" dest.push(data)\n",
" hanoi(num_disks-1, buff, dest, src)"
]
},
2015-06-27 18:31:30 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Unit Test\n",
2015-07-03 11:03:04 +08:00
"\n"
2015-06-27 18:31:30 +08:00
]
},
2015-05-21 05:20:49 +08:00
{
"cell_type": "code",
2015-06-27 18:31:30 +08:00
"execution_count": 3,
2015-05-21 05:20:49 +08:00
"metadata": {
"collapsed": false
},
2015-06-27 18:31:30 +08:00
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
2015-07-03 11:03:04 +08:00
"Overwriting test_hanoi.py\n"
2015-06-27 18:31:30 +08:00
]
}
],
2015-05-21 05:20:49 +08:00
"source": [
2015-07-03 11:03:04 +08:00
"%%writefile test_hanoi.py\n",
2015-06-27 18:31:30 +08:00
"from nose.tools import assert_equal\n",
"\n",
2015-07-03 11:03:04 +08:00
"\n",
"class TestHanoi(object):\n",
" \n",
2015-06-27 18:31:30 +08:00
" def test_hanoi(self):\n",
" num_disks = 3\n",
" src = Stack()\n",
" buff = Stack()\n",
" dest = Stack()\n",
"\n",
" print('Test: NULL towers')\n",
" hanoi(num_disks, None, None, None)\n",
"\n",
" print('Test: 0 disks')\n",
" hanoi(num_disks, src, dest, buff)\n",
" assert_equal(dest.pop(), None)\n",
"\n",
" print('Test: 1 disk')\n",
" 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",
2015-07-03 11:03:04 +08:00
"def main():\n",
" test = TestHanoi()\n",
" test.test_hanoi()\n",
" \n",
2015-06-27 18:31:30 +08:00
"if __name__ == '__main__':\n",
2015-07-03 11:03:04 +08:00
" main()"
]
},
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"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": [
"%run -i test_hanoi.py"
2015-05-21 05:20:49 +08:00
]
}
],
"metadata": {
"kernelspec": {
"display_name": "Python 2",
"language": "python",
"name": "python2"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
2015-06-18 04:39:43 +08:00
"version": "2.7.10"
2015-05-21 05:20:49 +08:00
}
},
"nbformat": 4,
"nbformat_minor": 0
}