Mercury_Lc的博客

二叉排序树（Binary Sort Tree），又称二叉查找树（Binary Search Tree），也称二叉搜索树。#include <stdio.h>#include <string.h>#include <stdlib.h>struct node{ int data; struct node *l, *r;};stru...

Hash表的平方探测思路：如果当前这个没存放数值，就放进去，如果当前这个地方Hash [ i ] 已经有数值了，就以平方的间隔左右寻找没有存放数的空白 Hash [ i ]。 #include <bits/stdc++.h>using namespace std;const int inf = 0x3f3f3f3f;int a[2000];int Hash[2000...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[1000005];int fin(int x,int l,int r){ int m = (l + r) / 2; if(l > r) return -1; if(a[m] == x) retu...

C++：#include <bits/stdc++.h>using namespace std;int n;struct node{ char data[55]; int num; struct node *lc, *rc;};void creat(struct node *&root,char s[]){ if(ro...

C：#include <stdio.h>#include <stdlib.h>#include <string.h>struct node{ char data[30]; struct node *lc; struct node *rc; int num;};char a[30];int n;struct n...

 （不知道为啥开个数组就 TLE 。QAQ）#include <stdio.h>#include <stdlib.h>#include <string.h>//const int maxn = 100005;////int a[maxn];int main(){ int n,k,ans,x; while(~scanf("%...

#include <stdio.h>#include <string.h>#include <stdlib.h>struct node{ int data; int h; struct node *lc,*rc; //平衡二叉树 需要一个 h 来记录平衡因子};int max(int x ,int y) { ...

#include <stdio.h>#include <string.h>#include <stdlib.h>int a[3500];int Hash[3500];int main(){ int n,p,t; while(~scanf("%d%d",&n,&p)) { memset(Ha...