data_structure

Author: EINDEX

Diff for: .travis.yml

@@ -0,0 +1,90 @@
+class LinkedList():
+    def __init__(self, value=None):
+        self.value = value
+        # 前驱
+        self.before = None
+        # 后继
+        self.behind = None
+
+    def __str__(self):
+        if self.value is not None:
+            return str(self.value)
+        else:
+            return 'None'
+
+
+def init():
+    return LinkedList('HEAD')
+
+
+def delete(linked_list):
+    if isinstance(linked_list, LinkedList):
+        if linked_list.behind is not None:
+            delete(linked_list.behind)
+            linked_list.behind = None
+            linked_list.before = None
+        linked_list.value = None
+
+
+def insert(linked_list, index, node):
+    node = LinkedList(node)
+    if isinstance(linked_list, LinkedList):
+        i = 0
+        while linked_list.behind is not None:
+            if i == index:
+                break
+            i += 1
+            linked_list = linked_list.behind
+        if linked_list.behind is not None:
+            node.behind = linked_list.behind
+            linked_list.behind.before = node
+        node.before, linked_list.behind = linked_list, node
+
+
+def remove(linked_list, index):
+    if isinstance(linked_list, LinkedList):
+        i = 0
+        while linked_list.behind is not None:
+            if i == index:
+                break
+            i += 1
+            linked_list = linked_list.behind
+        if linked_list.behind is not None:
+            linked_list.behind.before = linked_list.before
+        if linked_list.before is not None:
+            linked_list.before.behind = linked_list.behind
+        linked_list.behind = None
+        linked_list.before = None
+        linked_list.value = None
+
+
+def trave(linked_list):
+    if isinstance(linked_list, LinkedList):
+        print(linked_list)
+        if linked_list.behind is not None:
+            trave(linked_list.behind)
+
+
+def find(linked_list, index):
+    if isinstance(linked_list, LinkedList):
+        i = 0
+        while linked_list.behind is not None:
+            if i == index:
+                return linked_list
+            i += 1
+            linked_list = linked_list.behind
+        else:
+            if i < index:
+                raise Exception(404)
+            return linked_list
+
+
+linked_list = init()
+trave(linked_list)
+# delete(linked_list)
+insert(linked_list, 0, 1)
+insert(linked_list, 0, 2)
+insert(linked_list, 0, 3)
+remove(linked_list,2)
+trave(linked_list)
+print(find(linked_list,3))

Diff for: DataStructure/__init__.py

@@ -0,0 +1,59 @@
+class MyQueue():
+    def __init__(self, value=None):
+        self.value = value
+        # 前驱
+        # self.before = None
+        # 后继
+        self.behind = None
+
+    def __str__(self):
+        if self.value is not None:
+            return str(self.value)
+        else:
+            return 'None'
+
+
+def create_queue():
+    """仅有队头"""
+    return MyQueue()
+
+
+def last(queue):
+    if isinstance(queue, MyQueue):
+        if queue.behind is not None:
+            return last(queue.behind)
+        else:
+            return queue
+
+
+def push(queue, ele):
+    if isinstance(queue, MyQueue):
+        last_queue = last(queue)
+        new_queue = MyQueue(ele)
+        last_queue.behind = new_queue
+
+
+def pop(queue):
+    if queue.behind is not None:
+        get_queue = queue.behind
+        queue.behind = queue.behind.behind
+        return get_queue
+    else:
+        print('队列里已经没有元素了')
+
+def print_queue(queue):
+    print(queue)
+    if queue.behind is not None:
+        print_queue(queue.behind)
+
+queue = create_queue()
+push(queue,1)
+push(queue,2)
+push(queue,3)
+push(queue,4)
+print_queue(queue)
+print(pop(queue))
+print(pop(queue))
+print(pop(queue))
+print(pop(queue))
+print(pop(queue))

Diff for: DataStructure/linked_list.py

@@ -0,0 +1,41 @@
+class MyStack(object):
+    def __init__(self, value=None):
+        self.value = value
+        # 前驱
+        self.before = None
+        # 后继
+        self.behind = None
+
+    def __str__(self):
+        if self.value is not None:
+            return str(self.value)
+        else:
+            return 'None'
+
+
+def top(stack):
+    if isinstance(stack, MyStack):
+        if stack.behind is not None:
+            return top(stack.behind)
+        else:
+            return stack
+
+
+def push(stack, ele):
+    push_ele = MyStack(ele)
+    if isinstance(stack, MyStack):
+        stack_top = top(stack)
+        push_ele.before = stack_top
+        push_ele.before.behind = push_ele
+
+
+
+def pop(stack):
+    if isinstance(stack, MyStack):
+        stack_top = top(stack)
+        if stack_top.before is not None:
+            stack_top.before.behind = None
+            stack_top.behind = None
+            return stack_top
+        else:
+            print('已经是栈顶了')

Diff for: DataStructure/queue.py

@@ -1,5 +1,15 @@
 # Python Algorithm
 用Python实现各种算法
+## 数据结构
+- 数组（Array）
+- 堆栈（Stack）
+- 队列（Queue）
+- 链表（Linked List）
+- 树（Tree）
+- 图（Graph）
+- 堆（Heap）
+- 散列表（Hash）
+
 ## 排序算法
 
 - 冒泡排序
@@ -15,4 +25,6 @@
 
 - 顺序查找
 - 二分查找
-- Hash查找
+- 二叉查找树
+- 深度优先算法
+- 广度优先算法

Diff for: DataStructure/stack.py

@@ -1,13 +1,13 @@
 from unittest import TestCase
 
 
-def get_random_arr(max_num, len, is_int=False):
+def get_random_arr(max_num, length, is_int=False):
     """生成随机序列"""
     import random
     if is_int:
         return [int(random.uniform(0, 5000)) for x in range(1000)]
     else:
-        return [random.uniform(0, max_num) for x in range(len)]
+        return [random.uniform(0, max_num) for x in range(length)]
 
 
 def create_arr_list():