ArrayListaList = new ArrayList<>(); //Add elements to ArrayList object aList.add("1"); aList.add("2"); aList.add("3"); aList.add("4"); aList.add("5"); while (aList.listIterator().hasPrevious()) Log.d("reverse", "" + aList.listIterator().previous());
Collections.reverse(aList);
Example ( Reference ): 示例（ 参考 ）：
ArrayList aList = new ArrayList();
//Add elements to ArrayList object
aList.add("1");
aList.add("2");
aList.add("3");
aList.add("4");
aList.add("5");
Collections.reverse(aList);
System.out.println("After Reverse Order, ArrayList Contains : " + aList);
Not the simplest way but if you’re a fan of recursion you might be interested in the following method to reverse an ArrayList: 不是最简单的方法，但如果你是递归的粉丝，你可能会对以下方法感兴趣来反转ArrayList：
public ArrayList
A little more readable 更可读:)
public staticArrayList reverse(ArrayList list) { int length = list.size(); ArrayList result = new ArrayList (length); for (int i = length - 1; i >= 0; i--) { result.add(list.get(i)); } return result; }
Solution without using extra ArrayList or combination of add() and remove() methods. 解决方案，无需使用额外的ArrayList或add（）和remove（）方法的组合。 Both can have negative impact if you have to reverse a huge list. 如果你必须撤销一个巨大的列表，两者都会产生负面影响。
public ArrayList
Another recursive solution 另一种递归解决方案
public static String reverse(ArrayListlist) { if (list.size() == 1) { return " " +list.get(0); } else { return " "+ list.remove(list.size() - 1) + reverse(list); } }
