enginelong的博客

非递归方式// 快速排序void QuickSort(int* a, int low, int high){ int i=low, j=high, temp; if(low<high){ temp=a[i]; while(i<j){ while(i<j && a[j]>=temp) --j; a[i]=a[j]; .

给你一个字符串 s，找到 s 中最长的回文子串char * longestPalindrome(char * s){ int start, i, j, count, left, right, maxLength=0, len=strlen(s); if(len==1 || len==0) return s; for(i=0; i<len; i+=count){ left = i-1; right = i+1; count=1; //