反转ArrayList的最简单方法是什么？

本文翻译自：What is the Simplest Way to Reverse an ArrayList?

What is the simplest way to reverse this ArrayList? 反转此ArrayList的最简单方法是什么？

ArrayList<Integer> aList = 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());

---

#1楼

参考：https://stackoom.com/question/jAr6/反转ArrayList的最简单方法是什么

---

#2楼

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);

---

#3楼

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<Object> reverse(ArrayList<Object> list) {
    if(list.size() > 1) {                   
        Object value = list.remove(0);
        reverse(list);
        list.add(value);
    }
    return list;
}

Or non-recursively: 或非递归：

public ArrayList<Object> reverse(ArrayList<Object> list) {
    for(int i = 0, j = list.size() - 1; i < j; i++) {
        list.add(i, list.remove(j));
    }
    return list;
}

---

#4楼

A little more readable :) 更可读:)

public static <T> ArrayList<T> reverse(ArrayList<T> list) {
    int length = list.size();
    ArrayList<T> result = new ArrayList<T>(length);

    for (int i = length - 1; i >= 0; i--) {
        result.add(list.get(i));
    }

    return result;
}

---

#5楼

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<Object> reverse(ArrayList<Object> list) {

   for (int i = 0; i < list.size() / 2; i++) {
     Object temp = list.get(i);
     list.set(i, list.get(list.size() - i - 1));
     list.set(list.size() - i - 1, temp);
   }

   return list;
 }

---

#6楼

Another recursive solution 另一种递归解决方案

 public static String reverse(ArrayList<Float> list) {
   if (list.size() == 1) {
       return " " +list.get(0);
   }
   else {
       return " "+ list.remove(list.size() - 1) + reverse(list);
   } 
 }