算法题记录2

小Q最近遇到了一个难题：把一个字符串的大写字母放到字符串的后面，各个字符的相对位置不变，且不能申请额外的空间。
你能帮帮小Q吗？

输入描述:

输入数据有多组，每组包含一个字符串s，且保证:1<=s.length<=1000.
  

输出描述:

对于每组数据，输出移位后的字符串。

输入例子:

AkleBiCeilD

输出例子:

kleieilABCD

AC的答案：

public class Main {

    static String string = "hxKLAGLLzPyTxsFsrUnnSKQBHdQQrOyaEYJRgiJbHIDXFcQkFmIhPNKIBfHxXDBdKAvgZiBLVwnlxJAHmttsSJkZhSmQneNVoKoIYZRjPqsrFFaaqZbyNyeRjVKVFrCGdfycidTqbyQcpAtdRGzzBAaKoqybWMOyhrCQdwcRwQQpQavTnAbjriVwxJOrTYJVGYSWzKYeNAGqBzkJLucabNYvyVFxAGKLfqHXNttaqZfncEdTroGMzZnDbvZBBaRbJvuYIvlWrKaaGrvtyxrsCUOqxdwCrmVEeDrLKZKFJVRmrLsmbmOGUJyfdZIrFhuSwJQGRTYMLxKQNMaCavatlQIRZmFQvyWgQTVENxUcPKQCaUQbjyfaNuwoNdTBNldgrtPUcQodqsuJOdDpUczJWCZaasDdEYJkvituMHrCmZQSlRjIefVisatIUtfxBeKnHPyvWUKzRliFsYWgeXogiEgXDbfxAybwFuqFyEvjfIHEPDPKqEiGUtZhdDIDBGKpvBFyqHeEEhAToAbqHEpIdIhIGBtWjGHiQRctZxQQYkfFoWUbqZyIcjRPQBilHrnqNBzFmoRUYCSrGkawJCcOrMceegISpIpSGVjbngWVMTYtGoAlQFPFyOFAxndJZNfKDTwFIxisKTjyjchidXpYgLfoBOLriuIAHmAbQwoHBgbdUYBHlDQGZJASsHszOEPthLVnYbNqWegmONexfdsTVYHgtDmlyugefOBsqmgNDBoxkkhVHfvrYooVOyxDJQJLjYSngksbTopoPJFsKQzHePLukXyYTYCeW";

    public static void main(String[] args) {
        String tmp = getMovedString(string);
        System.out.print(tmp);
    }

    private static String getMovedString(String string) {
        char start = 'A';
        char end = 'Z';
        int countMoved = 0;
        int length = string.length() - countMoved;
        for (int i = 0; i < length; i++) {
            char tmp = string.charAt(i);
            if (tmp >= start && tmp <= end) {
                string = moveString(string, i, tmp);
                System.err.println(string);
                ++countMoved;
                --i;
                length = string.length() - countMoved;
            }
        }
        return string;
    }

    private static String moveString(String string, int index, char tmp) {
        StringBuffer buffer = new StringBuffer(string.substring(0, index));
        buffer.append(string.substring(index + 1));
        buffer.append(tmp);
        return buffer.toString();
    }
}