https://blog.twotigers.xyz/series/algorithm/ Recent content in algorithm on Two Tigers Engineering Hugo -- gohugo.io en-us Thu, 09 Dec 2021 09:12:25 +0800 https://blog.twotigers.xyz/posts/algorithm/sort/quicksort/ Thu, 09 Dec 2021 09:12:25 +0800 https://blog.twotigers.xyz/posts/algorithm/sort/quicksort/ 使用快排的思想 空间复杂度很垃圾, 只是为了更好的理解快排算法 TODO 修改成不需要额外空间的算法 def quicksort(data: list): if len(data) <= 1: return data less = [] more = [] pivot = data[0] for item in data: if item < pivot: less.append(item) elif item > pivot: more.append(item) return quicksort(less) + [pivot] + quicksort(more) data = [1, 4, 2, 6, 3, 10, 12, 11] print(quicksort(data)) https://blog.twotigers.xyz/posts/algorithm/tree/ Wed, 08 Dec 2021 14:12:25 +0800 https://blog.twotigers.xyz/posts/algorithm/tree/ class Node: def __init__(self, val, left=None, right=None) -> None: self.val = val self.left = left self.right = right def create_tree(data: list): if not data: return None first_node = Node(data[0]) tmp_list = [first_node] tmp_count = 0 for item in data[1:]: node = tmp_list[0] new_node = Node(item) if item is not None else None if tmp_count == 0: node.left = new_node # add to tmp_list if item is not None: tmp_list.append(new_node) tmp_count += 1 continue if tmp_count == 1: node.