我发现了面试中提出的问题，并为练习和娱乐而解决它们。
I find problems that were asked in interviews and solve them for practice and fun. (2020-12-25, Python, 0KB, 下载0次)
Introduction
1.介绍
1.1.目标
1.2.快速开始
1.3.什么是计算机科学
1.4.什么是编程
1.5.为什么要学习数据结构和抽象数据类型
1.6.为什么要学习算法
1.7.回顾Python基础
2.算法分析
2.1.目标
2.2.什么是算法分析
2.3.大O符号
2.4.一个乱序字符串检查的例子
2.5.Python数据结构的性能
2.6.列表
2.7.字典
2.8.总结
3.基本数据结构
3.1.目标
3.2.什么是线性数据结构
3.3.什么是栈
3.4.栈的抽象数据类型
3.5.Python实现栈
3.6.简单括号匹配
3.7.符号匹配
3.8.十进制转换成二进制
3.9.中缀前缀和后缀表达式
3.10.什么是队列
3.11.队列抽象数据类型
3.12.Python实现队列
3.13.模拟：烫手山芋
3.14.模拟：打印机
3.15.什么是Deque
3.16.Deque抽象数据类型
3.17.Python实现Deque
3.18.回文检查
3.19.列表
3.20.无序列表抽象数据类型
3.21.实现无序列表：链表
3.22.有序列表抽象数据结构
3.23.实现有序列表
3.24.总结
4.递归
4.1.目标
4.2.什么是递归
4.3.计算整数列表和
4.4.递归的三定律
4.5.整数转换为任意进制字符串
4.6.栈帧：实现递归
4.7.介绍：可视化递归
4.8.谢尔宾斯基三角形
4.10.汉诺塔游戏
4.11.探索迷宫
4.12.动态规划
4.13.总结
5.排序和搜索
Classic books on Python data structure (2020-07-14, Python, 5071KB, 下载0次)
一些常见算法实现和牛客网以及leetcode刷题
Some Common Algorithms Implementing and Title Brushing (2018-12-24, Python, 235KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-04-树5 Root of AVL Tree
编译器：python2
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules. (2016-04-12, Python, 2KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-05-树8 File Transfer
编译器：python2
We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer one computer to another. Is it possible to send a file any computer on the network to any other? (2016-04-12, Python, 1KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图2 Saving James Bond - Easy Version
编译器-python2
This time let us consider the situation in the movie Live and Let Die in which James Bond, the world s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land at the center of a lake filled with crocodiles. There he performed the most daring action to escape he jumped onto the head of the nearest crocodile! Before the animal realized what was happening, James jumped again onto the next big head... Finally he reached the bank before the last crocodile could bite him (actually the stunt man was caught by the big mouth and barely escaped with his extra thick boot). (2016-04-12, Python, 1KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图1 列出连通集
给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。
编译器：python2
Given a free E N vertices and edges of the graph, please list the set of all of its communication with the DFS and BFS. Assume that the vertices 0 to N-1N-1N-1 number. When you search, we always assume the smallest number of vertices in ascending numerical order adjacent access points. (2016-04-12, Python, 1KB, 下载4次)