摘要： 字典树模板，v记录当前节点下单词数，注意与当前节点相同（到当前节点为止）的单词的统计p->v-sumall_vnext#include #include#include#include#includeusing namespace std;#define zero {0}typedef struct Trie{ int v; Trie *next[26];} Trie;char s[100100][100];Trie root;void createTrie(char *str){ int len = strlen(str); Trie *p = &root, *q; ... 阅读全文

摘要： #include #include using namespace std ;int f(int ****a,int ***&d){ printf("%d\n",****a); printf("d=%d\n",***d); d=*a; printf("d=%d\n",***d); return 0;}int main(){ int A=9000; int *p=&A; int **p2=&p; int ***p3=&p2; int ****p4=&p3; int B=1000; int *pp1 阅读全文