qq_44787993的博客

一：B树：https://www.javatpoint.com/binary-tree 二：B+树：https://www.javatpoint.com/b-plus-tree 三：AVL树：https://www.javatpoint.com/avl-tree 四：二叉搜索树：https://www.javatpoint.com/binary-search-tree

一：升级枚举法： #include <iostream> #define max_INT -10000 using namespace std; int max_subArray(int a[],int n){ int max=max_INT; for(int i=0;i<n;i++){ int sum=0; for(int j=i;j<n;j++){ sum+=a[j];

#include <iostream> using namespace std; void Merge(int a[], int left, int mid, int right) { //暂存数据 int temp[right + 1]; for (int i = left; i <= right; i++) { temp[i] = a[i]; } int i = left, j = mid + 1, k = left; .