2015-05-11 01:36:43 +08:00
{
"cells": [
2015-06-18 04:39:18 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
]
},
2015-05-11 01:36:43 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Delete a node in the middle, given only access to that node.\n",
"\n",
"* [Clarifying Questions](#Clarifying-Questions)\n",
"* [Test Cases](#Test-Cases)\n",
"* [Algorithm](#Algorithm)\n",
2015-05-13 18:42:41 +08:00
"* [Code](#Code)"
2015-05-11 01:36:43 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Clarifying Questions\n",
"\n",
"* What if the final node is being deleted, for example a single node list?\n",
" * Make it a dummy node"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Test Cases\n",
"\n",
"* Empty list\n",
"* Null node to delete\n",
"* One node\n",
"* Multiple nodes"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Algorithm\n",
"\n",
"We'll need two pointers, one to the current node and one to the next node. We will copy the next node's data to the current node's data (effectively deleting the current node) and update the current node's next pointer.\n",
"\n",
2015-05-12 07:51:05 +08:00
"* Check for error cases listed above\n",
2015-05-11 01:36:43 +08:00
"* set curr.data to next.data\n",
"* set curr.next to next.next\n",
"\n",
"Complexity:\n",
"* Time: O(1)\n",
"* Space: In-place"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Code"
]
},
2015-05-13 18:39:16 +08:00
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": true
},
"outputs": [],
"source": [
"%run linked_list.py"
]
},
2015-05-11 01:36:43 +08:00
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": true
},
"outputs": [],
"source": [
"class Node(object):\n",
" def __init__(self, data):\n",
" self.data = data\n",
" self.next = None\n",
"\n",
2015-05-13 18:39:16 +08:00
"class MyLinkedList(LinkedList):\n",
2015-05-11 01:36:43 +08:00
" def delete_node(self, node):\n",
" if self.head is None:\n",
" return\n",
" if node is None:\n",
" return\n",
" next = node.next\n",
" if next is None:\n",
" node.data = None\n",
" node.next = None\n",
" else:\n",
" node.data = next.data\n",
2015-05-13 18:39:16 +08:00
" node.next = next.next"
2015-05-11 01:36:43 +08:00
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": false
},
"outputs": [],
"source": [
"# Empty list\n",
"linked_list = LinkedList(None)\n",
"linked_list.delete_node(None)\n",
"linked_list.print_list()\n",
"# One node\n",
"head = Node(2)\n",
"linked_list = LinkedList(head)\n",
"linked_list.delete_node(head)\n",
"linked_list.print_list()\n",
"# Multiple nodes\n",
"node0 = linked_list.insert_to_front(1)\n",
"node1 = linked_list.insert_to_front(3)\n",
"node2 = linked_list.insert_to_front(4)\n",
"node3 = linked_list.insert_to_front(1)\n",
"linked_list.delete_node(node2)\n",
"linked_list.print_list()"
]
}
],
"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:18 +08:00
"version": "2.7.10"
2015-05-11 01:36:43 +08:00
}
},
"nbformat": 4,
"nbformat_minor": 0
}