public class Solution {
public String LeftRotateString(String str,int n) {
if(str.length()==0) return new String();
char c[]=str.toCharArray();
int low=0,high=str.length()-1;
reverse(c,low,high);
reverse(c,0,str.length()-n-1);
reverse(c,str.length()-n,str.length()-1);
return new String(c);
}
void reverse(char[] str,int low,int high)
{
while(low<high)
{
swap(str,low++,high--);
}
}
void swap(char[] str,int low,int high)
{
char temp;
temp=str[low];
str[low]=str[high];
str[high]=temp;
}
} 
京公网安备 11010502036488号