数组逆序排列就是把升序排列的数组换成降序排列的数组,把降序排列的数组换成升序排列的数组,具体方法代码如下:
package lianxi;
/**
* 数组的逆序
*
* @来源 www.629niuniu.com
*
*/
public class Test2 {
public static void main(String[] args) {
int[] arr = { 1, 4, 6, 2, 8, 10, 30 };
// int count = 0;
// count = arr[0];
// arr[0] = arr[arr.length - 1];
// arr[arr.length - 1] = count;
System.out.print("逆序前");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
//开始逆序
for (int i = 0; i < arr.length / 2; i++) {
int count = 0;
count = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = count;
}
System.out.println();
System.out.print("逆序后");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}
输出结果
逆序前1 4 6 2 8 10 30
逆序后30 10 8 2 6 4 1