摘要:
内存管理 与Python对象创建相关的结构体 #define _PyObject_HEAD_EXTRA \ struct _object *_ob_next; \ struct _object *_ob_prev; #define PyObject_HEAD PyObject ob_base; #d 阅读全文
摘要:
冒泡排序 思路:从列表第一个元素开始,相邻两个相比较,如果前者比后者大,则交换,使最大的最终交换到列表末尾。 alist = [3, 5, 2, 4, 1, 9] def bubbleSort(alist): for i in range(0, len(alist) - 1): for j in r 阅读全文
摘要:
alist = [1, 2, 3, 4, 5, 6, 7, 8] def binarySearch(alist, target): first = 0 last = len(alist) - 1 while first <= last: middle_index = (first + last) / 阅读全文
摘要:
# coding:utf8 class Node(): def __init__(self, _item): self.item = _item self.left = None self.right = None class SortTree(): def __init__(self): self 阅读全文
摘要:
# coding:utf8 class Node(): def __init__(self, _item): self.item = _item self.left = None self.right = None class Tree(): def __init__(self): self.roo 阅读全文
摘要:
# conding:utf8 class Node(): def __init__(self, _item): self.item = _item self.next = None class Link(): def __init__(self): self._head = None def app 阅读全文
摘要:
# coding:utf8 class Queue(): def __init__(self): self.items = [] def enqueue(self, item): self.items.insert(0, item) def dequeue(self): return self.it 阅读全文
摘要:
# coding:utf8#节点类 class Node(): def __init__(self, _item): self.item = _item self.next = None #链表类 class Link(): def __init__(self): self._head = None 阅读全文
摘要:
栈的实现 class Stack(): def __init__(self): self.items = [] def push(self, item): self.items.append(item) def pop(self): return self.items.pop() def peek( 阅读全文
摘要:
发布订阅 ## subscribe 订阅一个或者多个频道 ## publish 给指定的频道发送消息 ## psubscribe 订阅指定模式的频道,*代表所有 ## pubsub channels 查看当前活跃的频道 ## pubsub numsub channels 查看当前频道的订阅人数 ## 阅读全文