2015-05-13 18:40:18 +08:00
{
" cells " : [
2015-06-18 04:39:18 +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:11:35 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Solution Notebook "
2015-06-18 04:39:18 +08:00
]
} ,
2015-05-13 18:40:18 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. \n " ,
" \n " ,
2015-06-30 17:55:58 +08:00
" * [Constraints](#Constraints) \n " ,
2015-05-13 18:40:18 +08:00
" * [Test Cases](#Test-Cases) \n " ,
" * [Algorithm](#Algorithm) \n " ,
2015-06-26 17:07:44 +08:00
" * [Code](#Code) \n " ,
" * [Unit Test](#Unit-Test) "
2015-05-13 18:40:18 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-06-28 19:13:27 +08:00
" ## Constraints \n " ,
2015-06-26 17:07:44 +08:00
" \n " ,
2016-06-13 11:10:28 +08:00
" * Do we expect the function to return a new list? \n " ,
2015-06-26 17:07:44 +08:00
" * Yes \n " ,
" * Can we assume the input x is valid? \n " ,
" * Yes \n " ,
" * Can we assume we already have a linked list class that can be used for this problem? \n " ,
2016-06-13 11:10:28 +08:00
" * Yes \n " ,
" * Can we create additional data structures? \n " ,
" * Yes \n " ,
" * Can we assume this fits in memory? \n " ,
2015-05-13 18:40:18 +08:00
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2015-07-03 11:11:35 +08:00
" * Empty list -> [] \n " ,
" * One element list -> [element] \n " ,
2015-05-13 18:40:18 +08:00
" * Left linked list is empty \n " ,
" * Right linked list is empty \n " ,
" * General case \n " ,
" * Partition = 10 \n " ,
2015-07-14 19:25:17 +08:00
" * Input: 4, 3, 13, 8, 10, 1, 10, 12 \n " ,
" * Output: 4, 3, 8, 1, 10, 10, 13, 12 "
2015-05-13 18:40:18 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
" * Create left and right linked lists \n " ,
" * For each element in the list \n " ,
" * If elem < x, append to the left list \n " ,
" * else, append to the right list \n " ,
" * Merge left and right lists \n " ,
" \n " ,
" Complexity: \n " ,
" * Time: O(n) \n " ,
" * Space: O(n) "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
2015-06-26 17:07:44 +08:00
" execution_count " : 1 ,
2015-05-13 18:40:18 +08:00
" metadata " : {
" collapsed " : true
} ,
" outputs " : [ ] ,
" source " : [
2015-07-03 11:11:35 +08:00
" %r un ../linked_list/linked_list.py "
2015-05-13 18:40:18 +08:00
]
} ,
{
" cell_type " : " code " ,
2015-06-26 17:07:44 +08:00
" execution_count " : 2 ,
2015-05-13 18:40:18 +08:00
" metadata " : {
2015-06-26 17:07:44 +08:00
" collapsed " : false
2015-05-13 18:40:18 +08:00
} ,
" outputs " : [ ] ,
" source " : [
" class MyLinkedList(LinkedList): \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-05-13 18:40:18 +08:00
" def partition(self, data): \n " ,
" if self.head is None: \n " ,
" return \n " ,
" left = MyLinkedList(None) \n " ,
" right = MyLinkedList(None) \n " ,
" curr = self.head \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:44 +08:00
" # Build the left and right lists \n " ,
2015-05-13 18:40:18 +08:00
" while curr is not None: \n " ,
" if curr.data < data: \n " ,
" left.append(curr.data) \n " ,
2015-07-14 19:25:17 +08:00
" elif curr.data == data: \n " ,
" right.insert_to_front(curr.data) \n " ,
2015-05-13 18:40:18 +08:00
" else: \n " ,
" right.append(curr.data) \n " ,
" curr = curr.next \n " ,
" curr_left = left.head \n " ,
" if curr_left is None: \n " ,
" return right \n " ,
" else: \n " ,
2015-06-26 17:07:44 +08:00
" # Merge the two lists \n " ,
2015-05-13 18:40:18 +08:00
" while curr_left.next is not None: \n " ,
" curr_left = curr_left.next \n " ,
" curr_left.next = right.head \n " ,
" return left "
]
} ,
2015-06-26 17:07:44 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
2015-05-13 18:40:18 +08:00
{
" cell_type " : " code " ,
2015-06-26 17:07:44 +08:00
" execution_count " : 3 ,
2015-05-13 18:40:18 +08:00
" metadata " : {
" collapsed " : false
} ,
2015-06-26 17:07:44 +08:00
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
2015-07-03 11:11:35 +08:00
" Overwriting test_partition.py \n "
2015-06-26 17:07:44 +08:00
]
}
] ,
2015-05-13 18:40:18 +08:00
" source " : [
2015-07-03 11:11:35 +08:00
" %% writefile test_partition.py \n " ,
2015-06-26 17:07:44 +08:00
" from nose.tools import assert_equal \n " ,
" \n " ,
2015-07-03 11:11:35 +08:00
" \n " ,
" class TestPartition(object): \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:44 +08:00
" def test_partition(self): \n " ,
" print( ' Test: Empty list ' ) \n " ,
" linked_list = MyLinkedList(None) \n " ,
" linked_list.partition(10) \n " ,
" assert_equal(linked_list.get_all_data(), []) \n " ,
" \n " ,
" print( ' Test: One element list, left list empty ' ) \n " ,
" linked_list = MyLinkedList(Node(5)) \n " ,
" linked_list.partition(0) \n " ,
" assert_equal(linked_list.get_all_data(), [5]) \n " ,
" \n " ,
" print( ' Test: Right list is empty ' ) \n " ,
" linked_list = MyLinkedList(Node(5)) \n " ,
" linked_list.partition(10) \n " ,
" assert_equal(linked_list.get_all_data(), [5]) \n " ,
" \n " ,
" print( ' Test: General case ' ) \n " ,
" # Partition = 10 \n " ,
2015-07-14 19:25:17 +08:00
" # Input: 4, 3, 13, 8, 10, 1, 14, 10, 12 \n " ,
" # Output: 4, 3, 8, 1, 10, 10, 13, 14, 12 \n " ,
2015-06-26 17:07:44 +08:00
" linked_list = MyLinkedList(Node(12)) \n " ,
" linked_list.insert_to_front(10) \n " ,
2015-07-14 19:25:17 +08:00
" linked_list.insert_to_front(14) \n " ,
2015-06-26 17:07:44 +08:00
" linked_list.insert_to_front(1) \n " ,
" linked_list.insert_to_front(10) \n " ,
" linked_list.insert_to_front(8) \n " ,
2015-07-14 19:25:17 +08:00
" linked_list.insert_to_front(13) \n " ,
2015-06-26 17:07:44 +08:00
" linked_list.insert_to_front(3) \n " ,
" linked_list.insert_to_front(4) \n " ,
" partitioned_list = linked_list.partition(10) \n " ,
2015-07-12 03:34:52 +08:00
" assert_equal(partitioned_list.get_all_data(), \n " ,
2015-07-14 19:25:17 +08:00
" [4, 3, 8, 1, 10, 10, 13, 14, 12]) \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:44 +08:00
" print( ' Success: test_partition ' ) \n " ,
" \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-07-03 11:11:35 +08:00
" def main(): \n " ,
" test = TestPartition() \n " ,
" test.test_partition() \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
" \n " ,
2015-06-26 17:07:44 +08:00
" if __name__ == ' __main__ ' : \n " ,
2015-07-03 11:11:35 +08:00
" main() "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 4 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
" Test: Empty list \n " ,
" Test: One element list, left list empty \n " ,
" Test: Right list is empty \n " ,
" Test: General case \n " ,
" Success: test_partition \n "
]
}
] ,
" source " : [
" run -i test_partition.py "
2015-05-13 18:40:18 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-13 11:10:28 +08:00
" display_name " : " Python 3 " ,
2015-05-13 18:40:18 +08:00
" language " : " python " ,
2016-06-13 11:10:28 +08:00
" name " : " python3 "
2015-05-13 18:40:18 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-13 11:10:28 +08:00
" version " : 3
2015-05-13 18:40:18 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-13 11:10:28 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.5.0 "
2015-05-13 18:40:18 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}