- 博客(7)
- 收藏
- 关注
RSS订阅原创 python 爬楼梯
def climbStairs( n): previous, current = 0, 1 for i in range(n): prev, current = current, previous + current return current if __name__ == '__main__': print(climbStairs(5)) ...
2019-08-26 17:41:12
228
原创 python 最短路径
G = {1: {1: 0, 2: 10, 4: 30, 5: 100}, 2: {2: 0, 3: 50}, 3: {3: 0, 5: 10}, 4: {3: 20, 4: 0, 5: 60}, 5: {5: 0}, } INF = 999999999 dis = dict((key, INF) for key in G) start=1 ...
2019-08-21 21:44:37
946
原创 Python 实现二叉搜索树插入
# encoding: utf-8 class Node: def __init__(self, data): self.data = data self.lchild = None self.rchild = None class BST: def __init__(self, node_lists): sel...
2019-08-20 19:58:54
396
原创 python 缓存淘汰
class LRUcache: def __init__(self, size=5): self.cache = {} self.elems = [] self.size = size def get_data(self, elem): if elem in self.cache: self...
2019-08-15 13:31:03
190
原创 归并排序
def merge(a, b): c = [] h = j = 0 while j < len(a) and h < len(b): if a[j] < b[h]: c.append(a[j]) j += 1 else: c.append(b[h]) ...
2019-08-12 20:01:28
131
原创 用数组实现一个顺序栈
class Stack(object): def __init__(self): self.stack = [] def push(self, item): self.stack.append(item) def pop(self): return self.stack.pop() def peek(s...
2019-08-12 19:41:11
865
原创 Task 1：数组和链表
【数组】 实现一个支持动态扩容的数组 实现一个大小固定的有序数组，支持动态增删改操作 - 实现两个有序数组合并为一个有序数组 - 学习哈希表思想，并完成leetcode上的两数之和(1)及Happy Number(202)！(要求全部用哈希思想实现！) class SortedArray: def __init__(self, capacity=15): "...
2019-08-09 22:15:50
162
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人