import java.util.Arrays;
/**
班级小组学生座位每周进行调换一次,加入现在一组学生的姓名放在一个数组中
String[] names={"张三","李四","王二","赵五"};
按位置调换后应该是
{"赵五","王二","李四","张三"}
分析规律:
长度为n的数组进行交换,进行前后对调
0与n-1对调
1与n-1-1对调,
2与n-1-2对调,
….
i与n-1-i对调,
一直调换到数组长度的1/2如果为奇数的话,中间不对调不影响。
*/
public class Swop {
public static void reverseArr(String[] names) {
for (int i = 0; i < names.length / 2; i++) {
String temp = names[i];
names[i] = names[names.length - i - 1];
names[names.length - i - 1] = temp;
}
System.out.println(Arrays.toString(names));
}
public static void main(String[] args) {
String[] names = { "张三", "李四", "王二", "赵五" };
System.out.println(Arrays.toString(names));
reverseArr(names);
}
}
/**
班级小组学生座位每周进行调换一次,加入现在一组学生的姓名放在一个数组中
String[] names={"张三","李四","王二","赵五"};
按位置调换后应该是
{"赵五","王二","李四","张三"}
分析规律:
长度为n的数组进行交换,进行前后对调
0与n-1对调
1与n-1-1对调,
2与n-1-2对调,
….
i与n-1-i对调,
一直调换到数组长度的1/2如果为奇数的话,中间不对调不影响。
*/
public class Swop {
public static void reverseArr(String[] names) {
for (int i = 0; i < names.length / 2; i++) {
String temp = names[i];
names[i] = names[names.length - i - 1];
names[names.length - i - 1] = temp;
}
System.out.println(Arrays.toString(names));
}
public static void main(String[] args) {
String[] names = { "张三", "李四", "王二", "赵五" };
System.out.println(Arrays.toString(names));
reverseArr(names);
}
}