qq_40663787的博客

list数组操作 lpush rpush lrange lindex llen lrem ltrim lset linsert before/after set操作 sadd smembers scard srem srandmember spop【随机】 smove 集合运算 sdiff sinter sunion hash操作 hset/hget/hmset/hmget/hgetall/...

#include <stdio.h> #include <stdlib.h> typedef struct kk { char ch; int flag; struct kk *left; struct kk *right; }btree; typedef struct stack { btree *btree[20]; ...

#include <stdio.h> #include <string.h> int KMP(char *t, char *p, int *next) { int a,i,j; a=0; i=0; j=0; while(i<strlen(t) && a<strlen(p)) if (t[i]==p[a]) { ...

#include <stdlib.h> #include <stdio.h> typedef struct node { int key; struct node *left; struct node *right; } Btree; Btree *InsertBtree(Btree *t,int x) { Btree *f = NULL,...

#include <iostream> #include<malloc.h> using namespace std; const int LEN = 640; typedef struct FreeStack { int len,address; struct FreeStack *next; }*FreeLink; typedef struct B...

#include <iostream> #include <list> using namespace std; //LRU算法 //Blocks 3 //data L: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 const int MaxLen = 3; const int Num = 20; typedef struct D...