算法与数据结构
文章平均质量分 72
LIJZ_Python
科技特长生资源总结与分享
展开
-
冒泡排序算法(Python)
def Fun_Sort(lst): lens = len(lst) - 1 for x in range(lens): for y in range(lens - x): if lst[y] > lst[y + 1]: lst[y], lst[y + 1] = \ lst...原创 2018-03-07 10:01:23 · 208 阅读 · 0 评论 -
二叉树的实现和遍历(Python)
class Node(object): def __init__(self, data=None, left=None, right=None): self.data = data self.left = left self.right = right class BinaryTree(object): def __init__(s...原创 2018-04-25 14:16:22 · 530 阅读 · 0 评论 -
利用Python实现栈和队列功能
一:利用Python实现栈的功能:class Stack(object): def __init__(self, size): self.size = size self.stack = [] self.top = -1 def push(self, x): if self.is_full(): ...原创 2018-04-19 21:00:46 · 727 阅读 · 0 评论 -
二叉树的简单实现(Python)
class Node: def __init__(self,item): self.item = item self.child1 = None self.child2 = None class Tree: def __init__(self): self.root = None def add(self...转载 2018-04-19 22:04:17 · 326 阅读 · 0 评论 -
爬虫技术库-urllib.request和requests库的使用(Python)
1. requests库 import requests headers = { 'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/64.0.3282.186 Safari/537.36', ...原创 2018-04-19 22:04:33 · 2577 阅读 · 0 评论 -
排序算法之桶排序(Python)
def bucket_sort(seq): length = (max(seq) - min(seq)) + 1 buckets = [0] * length m = min(seq) for value in seq: # 遍历序列,在相应的位置上加1,计数 buckets[value - m] += 1 result = [] ...原创 2018-03-16 14:08:17 · 221 阅读 · 0 评论 -
算法之归并排序(Python)
def merge(left, right): i, j = 0, 0 result = [] # 将两个序列按升序合并 while i < len(left) and j < len(right): if left[i] <= right[j]: result.append(left[i]) ...原创 2018-03-16 13:19:27 · 178 阅读 · 0 评论 -
算法之快速排序(Python)
def partition(seq, low, high): """以枢轴元素为分界点,将序列分为两部分:小值、大值""" i, j = low, high base = seq[i] # 将序列的第一个元素作为枢轴元素 while i < j: # 从表的两端交替向中间扫描 while i < j and seq[j] >...原创 2018-03-16 13:17:57 · 178 阅读 · 0 评论 -
二叉树实现数据存储和遍历(Python)
class TreeNode: def __init__(self, data, left, right): self.data = data self.left = left self.right = right class BinaryTree: def __init__(self): self.root = N...原创 2018-03-16 13:15:00 · 1525 阅读 · 0 评论 -
二分查找法(Python)
def binnerFind(lst, value): start = 0 end = len(lst) - 1 while start <= end: mid = (start + end) // 2 if lst[mid] > value: end = mid - 1 elif lst[...原创 2018-03-07 10:50:09 · 1255 阅读 · 0 评论 -
选择排序算法(Python)
def selectSort(lst): lens = len(lst) for i in range(lens - 1): mindex = i for j in range(i+1, lens): if lst[mindex] > lst[j]: mindex = j ...原创 2018-03-07 10:47:27 · 150 阅读 · 0 评论 -
插入排序算法(Python)
def insertSort(lst): lens = len(lst) for i in range(1, lens): if lst[i-1] > lst[i]: temp = lst[i] index = i while index > 0 and lst[index-1]&g...原创 2018-03-07 10:09:00 · 277 阅读 · 0 评论