第三题,
package 练习题;
import java.util.Scanner;
public class array {
public static void main(String[] args) {
int n = 0, m = 0, i, k = 0;
System.out.print("输入n:");
Scanner n1 = new Scanner(System.in);
n = n1.nextInt();
System.out.print("输入m:");
Scanner m1 = new Scanner(System.in);
m = m1.nextInt();
int[] A = new int[n + m];
int[] a = new int[n];
int[] b = new int[m];
System.out.print("输入这个数组的元素(n+m=" + (m + n) + "个)");
Scanner in = new Scanner(System.in);
for (i = 0; i < (m + n); i++) {
A[i] = in.nextInt();
}
System.out.print("没互换之前A=");
for (i = 0; i < (m + n); i++) {
System.out.print(A[i] + " ");
}
System.out.println();
System.out.print("a=");
for (i = 0; i < n; i++) {
a[i] = A[i];
System.out.print(a[i] + " ");
}
System.out.println();
System.out.print("b=");
for (i = n; i < (n + m); i++) {
b[i - n] = A[i];
System.out.print(b[i - n] + " ");
}
System.out.println();
System.out.print("互换后A=");
for (i = 0; i < m; i++) {
A[i] = b[i];
}
for (i = m; i < (m + n); i++) {
A[i] = a[i-m];
}
for (i = 0; i < (m + n); i++) {
System.out.print(A[i] + " ");
}
}
}
第一题
package 练习题;
import java.util.Scanner;
public class Array2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int n = 0, m = 0, l = 0, i = 0, k = 0, j = 0;
;
System.out.print("输入元素个数n:");
Scanner n1 = new Scanner(System.in);
n = n1.nextInt();
if (n % 2 == 0)
k = m = n / 2;
else {
m = (int) n / 2 + 1;
k = (int) n / 2;
}
System.out.println(m + "," + k);
int[] A = new int[n];
int[] a = new int[m];// 奇数位置部分
int[] b = new int[k];// 偶数位置部分
System.out.print("输入这个数组的元素,个数为" + n + "个)");
Scanner in = new Scanner(System.in);
for (i = 0; i < n; i++) {
A[i] = in.nextInt();
}
System.out.print("没互换之前A=");
for (i = 0; i < n; i++) {
System.out.print(A[i] + " ");
}
System.out.println();
System.out.print("偶数位置的元素为a=");
for (i = 0; i < n; i++) {// 奇数 位置部分
if (i % 2 == 0) {
a[j] = A[i];
System.out.print(a[j] + " ");
j++;
}
}
j=0;//初始化j;
System.out.println();
System.out.print("奇数位置的元素为b=");
for (i = 0; i < n; i++) {// 偶数位置部分
if (i % 2 != 0) {
b[j] = A[i];
System.out.print(b[j] + " ");
j++;
}
}
System.out.println();
System.out.print("调整后A=");
for (i = 0; i < k; i++) {
A[i] = b[i];
}
for (i = k; i < n; i++) {
A[i] = a[i - k];
}
for (i = 0; i < n; i++) {
System.out.print(A[i] + " ");
}
}
}