在理解红黑树之前，咱们先来意识2-3树，在算法里也是先从2-3树切入到红黑树的。并且理解2-3树对于了解B类树也会有帮忙，因为2-3树能够说就是根底的B类树。

一、罕用数据结构1、数组、字符串（1）字符串转化因为须要针对字符串当中的每一个字符进行剖析和解决，有时候字符串转换成字符数组（2）数组的长处构建非常简单能在 O(1) 的工夫里依据数组的下标（index）查问某个元素（3）数组的毛病构建时必须调配一段间断的空间查问某个元素是否存在时，须要遍历整个数组，消耗 O(n) …

读完本文，你能够去力扣拿下如下题目：92.反转链表II———–反转单链表的迭代实现不是一个艰难的事件，然而递归实现就有点难度了，如果再加一点难度，让你仅仅反转单链表中的一部分，你是否可能递归实现呢？本文就来由浅入深，step by step 地解决这个问题。如果你还不会递归地反转单链表也没关系，本文会从递归反转…

假如字符串A的长度为m, 字符串B的长度为n, 应用一个数组fm示意对应后果, 其中f[i][j]示意 A.substr(0, i) 和 B.substr(0, j)这两个子字符串的LCS.

以下5个习题是用dfs解决数组or链表和二叉树互相转换的问题，进行对立一起解决能够无效地加强学习，坚固记忆。105. 从前序与中序遍历序列结构二叉树题目形容依据一棵树的前序遍历与中序遍历结构二叉树。留神:你能够假如树中没有反复的元素。例如，给出前序遍历 preorder = [3,9,20,15,7]中序遍历 inorder = [9,3,15,20,7]…

如上图所示，实际上该问题，等价与初始和为0，获得每一个数字作为终点的所有子序列和的最大值中的最大值，如图中所标注的20.间接应用深度优先搜寻解决。代码如下：

Professional Ability Test (PAT) consists of several series of subject tests. Each test is divided into several levels. Level A is a prerequisite (前置要求) of Level B if one must pass Level A with a score no less than S in order to be qualified to take Level B. At the mean time, one who passes Le…

The land is for sale in CyberCity, and is divided into several pieces. Here it is assumed that each piece of land has exactly two neighboring pieces, except the first and the last that have only one. One can buy several contiguous（间断的） pieces at a time. Now given the list of prices of the la…

PP milk （盆盆奶）is Pandas’ favorite. They would line up to enjoy it as show in the picture. On the other hand, they could drink in peace only if they believe that the amount of PP milk is fairly distributed, that is, fatter panda can have more milk, and the ones with equal weight may have the s…

The left-view of a binary tree is a list of nodes obtained by looking at the tree from left hand side and from top down. For example, given a tree shown by the figure, its left-view is { 1, 2, 3, 4, 5 }