摘要： Rotate a one-dimensional vector of n elements left by i positions.Solution1 1 void Solution(char* arr,int n,int rotdist) 2 { 3 int i; 4 //循环n和rotdist的最大公约数次 5 for(i=0;i<gcd(n,rotdist);++i) 6 { 7 char t=arr[i]; 8 int index=i; 9 while((index+rotdist)%n!=i)10 ... 阅读全文