反转数组——Java语言的实现方法
方法一: 前后次序颠倒
public class Array{
public static void main(String[] args){
int[] arr={1,2,5,7,3};
for (int k=0;k<arr.length/2;k++){
int w=arr[k];
arr[k]=arr[arr.length-1-k];
arr[arr.length-1-k]=w;
}
for (int k = 0; k < 5; k++) {
System.out.print(arr[k]+" ");
}
}
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
方法二:两边夹(自己给的称呼)——趋中逼近
public class Array{
public static void main(String[] args){
int[] arr={1,2,3,4,5};
for(int m=0,n=4;m<n;m++,n--){
int t=arr[m];
arr[m]=arr[n];
arr[n]=t;
}
for (int k = 0; k < 5; k++) {
System.out.print(arr[k]+" ");
}
}
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
方法三:创建空数组
public class Array{
public static void main(String[] args){
int[] arr={1,2,3,4,5};
int[] A = new int[arr.length];
for (int i=0;i<arr.length;i++){
A[i] = arr[arr.length-i-1];
}
for (int i=0;i<A.length;i++){
arr[i] = A[i];
System.out.print(arr[i]+" ");
}
}
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15