package cn.aparke.sort;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Random;

public class ArrayReverse {
	// 省略get(),set()
	int[] originArray; // 原始数组
	int[] reverseArray;// 反转后的数组
	int length = 0; // 原始数组的长度

	public void show(int[] array) {
		for (int number : array) {
			System.out.print(number + " ");
		}
		System.out.println();
	}

	public void arrayReverse1() {
		reverseArray = new int[length];
		ArrayList arraylist = new ArrayList();
		for (int i = 0; i < length; i++) {
			arraylist.add(originArray[i]);
		}
		Collections.reverse(arraylist);
		for (int i = 0; i < length; i++) {
			reverseArray[i] = (int) arraylist.get(i);
		}
	}

	public void arrayReverse2() {
		reverseArray = new int[length];
		for (int i = 0; i < length; i++) {
			reverseArray[i] = originArray[length - i - 1];
		}

	}

	public void arrayReverse3() {
		int temp = 0;
		for (int i = 0; i < length / 2; i++) {
			temp = originArray[i];
			originArray[i] = originArray[length - i - 1];
			originArray[length - i - 1] = temp;
		}
	}

	public void createArray(int number) {
		Random random = new Random();
		originArray = new int[number];
		length = number;
		for (int i = 0; i < number; i++) {
			originArray[i] = random.nextInt(10);
		}
	}

	public static void main(String[] args) {
		ArrayReverse ar = new ArrayReverse();
		ar.createArray(10);
		System.out.print("原数组：");
		ar.show(ar.originArray); // 显示初始顺序
		System.out.print("第一种：");
		// 第一种reverse结果
		ar.arrayReverse1();
		ar.show(ar.reverseArray);
		// 第二种
		System.out.print("第二种：");
		ar.arrayReverse2();
		ar.show(ar.reverseArray);
		// 第三种
		System.out.print("第三种：");
		ar.arrayReverse3();
		ar.show(ar.originArray);
	}
}