将顺序的数据颠倒，复杂度为n和二分之n的算法

1、复杂度为n，直接遍历一次，

2、复杂度为n/2，首尾交换即可

public class Diandao {

/**
* @param args
*/
public static void main(String[] args) {
int[] arrayForOdd = new int[]{1,2,3,4,5,6,7};
int[] arrayForEven = new int[]{1,2,3,4,5,6};
print(getReverseArrayn(arrayForOdd));
print(getReverseArrayn_2(arrayForOdd));
print(getReverseArrayn(arrayForEven));
print(getReverseArrayn_2(arrayForEven));
}

public static int[] getReverseArrayn(int[] arrays){
if(arrays==null||arrays.length<=1){
return arrays;
}
int num = arrays.length;
int[] newArrays = new int[num];
for(int i=0;i<num;i++){
newArrays[i] = arrays[num-1-i];
}
return newArrays;
}

public static int[] getReverseArrayn_2(int[] arrays){
if(arrays==null||arrays.length<=1){
return arrays;
}
int num = arrays.length;
for(int i=0;i<num/2;i++){
int n = arrays[i];
arrays[i] = arrays[num-1-i];
arrays[num-1-i] = n;
}
return arrays;
}

public static void print(int[] arrays){
if(arrays==null){
System.out.println("it is null");
}
for(int i=0;i<arrays.length;i++){
System.out.print(arrays[i]+",");
}
System.out.println();
}
}