Dilthey's Blog

Description A palindrome is a string of symbols that is equal to itself when reversed. Given an input string, not necessarily a palindrome, compute the number of swaps necessary to transform the st

排序的水题，主要拿来测试了一下快速排序和归并排序哪个速度快一点。 #include #include using namespace std; void merge(int num[],int st,int md,int ed) { int l_len=md-st+1,r_len=ed-md; int l[l_len+2],r[r_len+2]; for(int i=1;