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

Update hanoi challenge (#121)

Browse Source 
Update constraints and test cases.  Move implementation to a class.  Update tests.
This commit is contained in:
Donne Martin
2016-11-19 09:01:44 -05:00
committed by GitHub
parent 14de5e4233
commit 430cca2a01
3 changed files with 70 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
recursion_dynamic/hanoi/test_hanoi.py
View File

@@ -1,32 +1,33 @@
from nose.tools import assert_equal
from nose.tools import assert_equal, assert_raises
class TestHanoi(object):
def test_hanoi(self):
hanoi = Hanoi()
num_disks = 3
src = Stack()
buff = Stack()
dest = Stack()
print('Test: None towers')
hanoi(num_disks, None, None, None)
assert_raises(TypeError, hanoi.move_disks, num_disks, None, None, None)
print('Test: 0 disks')
hanoi(num_disks, src, dest, buff)
hanoi.move_disks(num_disks, src, dest, buff)
assert_equal(dest.pop(), None)
print('Test: 1 disk')
src.push(5)
hanoi(num_disks, src, dest, buff)
hanoi.move_disks(num_disks, src, dest, buff)
assert_equal(dest.pop(), 5)
print('Test: 2 or more disks')
for i in range(num_disks, -1, -1):
src.push(i)
hanoi(num_disks, src, dest, buff)
for i in range(0, num_disks):
assert_equal(dest.pop(), i)
for disk_index in range(num_disks, -1, -1):
src.push(disk_index)
hanoi.move_disks(num_disks, src, dest, buff)
for disk_index in range(0, num_disks):
assert_equal(dest.pop(), disk_index)
print('Success: test_hanoi')