public class ArrayInverse {
public static void main(String[] args) {
String []a={"a","b","c","d","e"};
for (int i = 0; i < a.length; i++) {
String temp=null;
int j=a.length-1-i;
if(i<=j){ //i=j时是临界点,i<=j时,已经全部反转好了,此时不需要再遍历下去
temp=a[i];
a[i]=a[j];
a[j]=temp;
System.out.println("a[i]="+a[i]+" a[j]="+a[j]+" 时temp="+temp);
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i]);
}
}
}
运行结果:
edcba