快排
void quick_sort(int a[], int l, int r) {
if (l >= r)return;
int p = a[l];
int i = l - 1, j = r + 1;//左右各移动一格，配合do-while
while (i < j) {
do i++; while (a[i] < p);
do j-...
void GetNext(char *s){ int len = strlen(s); int i,j; i = 0; j = -1;//j从0开始，i从1开始 next[0] = -1; for (i = 1; i < len; ++i) { while (j > -1 && s[j + 1]...
dfs算法模板：1、下一层是多节点的dfs遍历def dfs(array or root, cur_layer, path, result): if cur_layer == len(array) or not root: result.append(path) return for i in range(cur_layer,...
/*
KMP算法
by KONE
*/
#include<iostream>
#include<string>
using namespace std;
int* getNxte(char p[], const int size){
int* next = new int[size];
next[0] = -1; //最开头...
