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

Fix #13, PEP8-ify notebooks.

Browse Source
This commit is contained in:
Donne Martin
2015-07-11 15:39:59 -04:00
parent 4566d1a803
commit 3712839cc9
26 changed files with 139 additions and 92 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
stacks_queues/n_stacks/n_stacks_challenge.ipynb
View File

@@ -34,7 +34,6 @@
"source": [
"## Constraints\n",
"\n",
"* Are the stacks and array a fixed size?\n",
" * Yes"
]
@@ -77,7 +76,7 @@
"outputs": [],
"source": [
"class Stacks(object):\n",
" \n",
"\n",
" def __init__(self, num_stacks, stack_size):\n",
" # TODO: Implement me\n",
" pass\n",
@@ -120,7 +119,7 @@
"\n",
"\n",
"class TestStacks(object):\n",
" \n",
"\n",
" @raises(Exception)\n",
" def test_pop_on_empty(self, num_stacks, stack_size):\n",
" print('Test: Pop on empty stack')\n",
@@ -151,14 +150,16 @@
"\n",
" print('Success: test_stacks\\n')\n",
"\n",
"\n",
"def main():\n",
" num_stacks = 3\n",
" stack_size = 100 \n",
" stack_size = 100\n",
" test = TestStacks()\n",
" test.test_pop_on_empty(num_stacks, stack_size)\n",
" test.test_push_on_full(num_stacks, stack_size)\n",
" test.test_stacks(num_stacks, stack_size)\n",
" \n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]

13
stacks_queues/n_stacks/n_stacks_solution.ipynb
View File

@@ -33,7 +33,6 @@
"source": [
"## Constraints\n",
"\n",
"* Are the stacks and array a fixed size?\n",
" * Yes"
]
@@ -107,7 +106,7 @@
"outputs": [],
"source": [
"class Stacks(object):\n",
" \n",
"\n",
" def __init__(self, num_stacks, stack_size):\n",
" self.num_stacks = num_stacks\n",
" self.stack_size = stack_size\n",
@@ -129,7 +128,7 @@
" if self.stack_pointers[stack_index] == -1:\n",
" raise Exception('Stack is empty')\n",
" else:\n",
" array_index = self.abs_index(stack_index) \n",
" array_index = self.abs_index(stack_index)\n",
" data = self.stack_array[array_index]\n",
" self.stack_array[array_index] = None\n",
" self.stack_pointers[stack_index] -= 1\n",
@@ -166,7 +165,7 @@
"\n",
"\n",
"class TestStacks(object):\n",
" \n",
"\n",
" @raises(Exception)\n",
" def test_pop_on_empty(self, num_stacks, stack_size):\n",
" print('Test: Pop on empty stack')\n",
@@ -197,14 +196,16 @@
"\n",
" print('Success: test_stacks\\n')\n",
"\n",
"\n",
"def main():\n",
" num_stacks = 3\n",
" stack_size = 100 \n",
" stack_size = 100\n",
" test = TestStacks()\n",
" test.test_pop_on_empty(num_stacks, stack_size)\n",
" test.test_push_on_full(num_stacks, stack_size)\n",
" test.test_stacks(num_stacks, stack_size)\n",
" \n",
"\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]

2
stacks_queues/n_stacks/test_n_stacks.py
View File

@@ -34,6 +34,7 @@ class TestStacks(object):
print('Success: test_stacks\n')
def main():
num_stacks = 3
stack_size = 100
@@ -42,5 +43,6 @@ def main():
test.test_push_on_full(num_stacks, stack_size)
test.test_stacks(num_stacks, stack_size)
if __name__ == '__main__':
main()