09 2021 档案
摘要:''' 栈 实现语言: Python 有次序的数据集, 每个数据仅从栈顶一端加入和从数据集中移除 ''' class Stack: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] # 入栈
阅读全文
摘要:''' 链表实现 ''' # 节点 class Node: def __init__(self, init_data): self.data = init_data self.next = None def get_data(self): return self.data def get_next(
阅读全文
摘要:''' 双端队列 线性结构 首尾两端皆可添加删除数据 ''' class Deque: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def addFront(self, item): s
阅读全文
摘要:''' 队列 Queue 先进先出 ''' class MyQueue: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] # 入队列 def enqueue(self, item): sel
阅读全文
摘要:stack.py ''' 栈 实现语言: Python 有次序的数据集, 每个数据项仅从栈顶一端加入和移除 ''' class Stack: def __init__(self): self.items = [] def isEmpty(self): return self.items == []
阅读全文
摘要:CMakeLists.txt cmake_minimum_required(VERSION 3.20) project(tttt) set(CMAKE_CXX_STANDARD 17) # 将C/Cpp源文件生成动态库和静态库 add_library(hello_shared SHARED hell
阅读全文