摘要：link class Solution { public: struct TrieNode{ TrieNode* children[26]; int id; TrieNode(){ id=-1; for(int i=0;i<26;i++) children[i]=nullptr; } }; Trie 阅读全文

摘要：#include <iostream> #include <algorithm> # define LL long long using namespace std; const int maxn=11000002; char data[maxn<<1]; int len[maxn<<1]; int 阅读全文

摘要：Code: 1 #include<bits/stdc++.h> 2 using namespace std; 3 4 void manacher(string &ss, vector<int> &leftPart){ 5 vector<int> t(ss.size(),0); 6 int middl 阅读全文