Question

A java exercise please！

Write a static method named swapHavles that takes an ArrayList of integers as a a parameter and returns a new ArrayList that has every element in the second half of the original ArrayList swapped with every element in the first half of the original ArrayList. Note: • You can assume that the ArrayList passed to this method as a parameter always contains an even number of elements and will always contain at least two elements. For example: Test Result [6, 7, 8, 9, 10, 1, 2, 3, 4, 5) ArrayList<Integer numbers = new ArrayList<Integer>(); for (int i=1; i<=10; i++) numbers.add(i); System.out.println(swapHalves (numbers)); Answer: (penalty regime: 0 %) 1 public static |

Answer 1

public static ArrayList<Integer> swapHalves(ArrayList<Integer> list) {

int i = 0 , j = list.size()/2;

while( j < list.size() & i <= list.size()/2) {

int temp = list.get(i);

list.set(i, list.get(j));

list.set(j, temp);

++i;

++j;

}

return list;

}

=======================================
SEE OUTPUT

29 public static ArrayList<Integer> swapHalves (ArrayList<Integer> list) { int i = 0 , j = list.size()/2; while( j < list.size() & i <= list.size()/2) [ int temp = list.get(i); list.set(i, list.get(j)); list.set(j, temp); ++i; ++j; return list; 41 2 Console X XX Ex aeg <terminated> Sort [Java Application] /Library/Java/JavaVirtual Machines/jdk1.8.0_202.jdk/Contents/Home/bin/java ( [6, 7, 8, 9, 10, 1, 2, 3, 4, 5]



Thanks, PLEASE COMMENT if there is any concern.