左旋转字符串（字符串）

题目描述：汇编语言中有一种移位指令叫做循环左移（ROL），现在有个简单的任务，就是用字符串模拟这个指令的运算结果。对于一个给定的字符序列S，请你把其循环左移K位后的序列输出。例如，字符序列S=”abcXYZdef”,要求输出循环左移3位后的结果，即“XYZdefabc”。是不是很简单？OK，搞定它！

思路一：

public class Solution {
    public String LeftRotateString(String str,int n) {
        if (str.length() == 0 || n < 0) return "";
        n = n % str.length();
        if (n == 0) return str;
        StringBuffer sb = new StringBuffer();
        for (int i = 0; i < str.length(); i++)
            sb.append(str.charAt((i + n) % str.length()));
        return sb.toString();
    }
}

思路二：

public class Solution {
    public String LeftRotateString(String str,int n) {
        if (str.length() == 0 || n < 0) return "";
        n = n % str.length();
        if (n == 0) return str;
        String s1 = str.substring(0, n);
        String s2 = str.substring(n, str.length());
        return s2 + s1;
    }
}

public class Solution {
    public String LeftRotateString(String str,int n) {
        if (str.length() == 0 || n < 0) return "";
        int len = str.length();
        n  = n % len;
        if (n == 0) return str;
        str += str;
        return str.substring(n, len + n);
    }
}

思路三：

public class Solution {
    public String LeftRotateString(String str,int n) {
        if (str.length() == 0 || n < 0) return "";
        char[] chars = str.toCharArray();
        n = n % str.length();
        if (n == 0) return str;
        reverse(chars, 0, n - 1);
        reverse(chars, n, str.length() - 1);
        reverse(chars, 0, str.length() - 1);
        return String.valueOf(chars);
    }
    private void reverse(char[] chars, int start, int end)
    {
        while (start < end)
        {
            char temp = chars[start];
            chars[start] = chars[end];
            chars[end] = temp;
            start++;
            end--;
        }
    }
}