字符数组快速求最小字典

 1 int Min_index(char *ss){
 2     int i = 0,j = 1, k = 0;
 3     int len = strlen(ss);
 4     while(i<len && j<len && k<len){
 5         int t = ss[(j+k)%len]-ss[(i+k)%len];
 6         if(t == 0)k++;
 7         else{
 8             if(t>0) j+=k+1;
 9             else i+=k+1;
10             k=0;
11         }
12         if(i==j)j++;
13     }
14     return min(i,j);
15 }