1. 算法思想
首尾两个元素依次交换位置。
2. 代码实现
public class ArrayReverse {
public void reverse(int[] a){
for (int i = 0; i < a.length / 2; i++) {
// 交换首尾两个元素
int temp = a[i];
a[i] = a[a.length - 1 -i];
a[a.length - 1 -i] = temp;
}
}
}
3. 测试
int[] a = {13,28,65,21,47,98};
ArrayReverse arrayReverse = new ArrayReverse();
arrayReverse.reverse(a);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + "\t");
}