list的倒数第二位元素移动到第一位

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class MoveUtils {
    public static void main(String[] args) {
        List<Object> strList = new ArrayList();
        strList.add("2");
        strList.add("%副主任%");
        strList.add("广州局");
        strList.add("87F58FAA516B801EE0430A961103801A");
        strList.add("1");
        System.out.println("改变之前的顺序：");
        for (int i = 0; i < strList.size(); i++) {
            System.out.println(strList.get(i));
        }
        //向右移动
        System.out.println("strList.size() = " + strList.size());
        int count = strList.size();
        List<Object> move = rightMove(strList, strList.size()+1);
        System.out.println("向右移动改变之后的顺序：");
        System.out.println(move);
        System.out.println("方法一：将最后和最前位置兑换");
        Collections.swap(move,count-1,0);
        System.out.println("方法一改变之后的顺序：");
        for (int i = 0; i < move.size(); i++) {
            System.out.println(move.get(i));
        }
    }
    private static List<Object> rightMove(List list, int count) {
        int originSize = list.size();
        count = originSize - count % originSize;
        for (int i = 0; i < count; i++) {
            list.add(list.get(i));
        }
        return list.subList(list.size() - originSize, list.size());
    }
}