解题思路:
一步一步理清思路即可,注意的是去重时判断条件用常量
注意事项:
参考代码:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n1 = scanner.nextInt();
int[] arr1 = new int[n1];
for (int i = 0; i < n1; i++) {
arr1[i] = scanner.nextInt();
}
int n2 = scanner.nextInt();
int[] arr2 = new int[n2];
for (int i = 0; i < n2; i++) {
arr2[i] = scanner.nextInt();
}
//交集
ArrayList arrayList = new ArrayList<>();
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr2.length; j++) {
if (arr1[i] == arr2[j]) {
arrayList.add(arr1[i]);
}
}
}
Collections.sort(arrayList);
for (Object a : arrayList) {
System.out.print(a + " ");
}
System.out.println();
//并集
//先将两个集合连接;然后去重
int[] arr3 = new int[arr1.length + arr2.length];
//拼接
int index = 0;
for (int i = 0; i < arr1.length; i++) {
arr3[index] = arr1[i];
index++;
}
for (int i = 0; i < arr2.length; i++) {
arr3[index] = arr2[i];
index++;
}
//去重
int l = arr3.length;//确定新数组长度
for (int i = 0; i < l - 1; i++) {
for (int j = i + 1; j < l; ) {
if (arr3[i] == arr3[j]) {
for (int k = j; k < l - 1; k++) {
arr3[k] = arr3[k + 1];
}
l--;
} else
j++;
}
}
//去重后的数组
int[] arr4 = Arrays.copyOf(arr3, l);
//排序
Arrays.sort(arr4);
for (int a : arr4) {
System.out.print(a + " ");
}
//余集
ArrayList arrayList1 = new ArrayList<>();
for (int i = 0; i < arr1.length; i++) {
boolean flag = true;
for (int j = 0; j < arr2.length; j++) {
if (arr1[i] == arr2[j]) {
flag = false;
break;
}
}
if (flag) {
arrayList1.add(arr1[i]);
}
}
Collections.sort(arrayList1);
System.out.println();
for (Object a : arrayList1) {
System.out.print(a + " ");
}
}
}
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题10.7 (C语言代码)浏览:639 |
C语言训练-求函数值 (C语言代码)浏览:911 |
2004年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:667 |
简单的a+b (C语言代码)浏览:643 |
C语言考试练习题_排列 (C语言代码)浏览:1315 |
【亲和数】 (C语言代码)浏览:539 |
买不到的数目 (C++代码)浏览:862 |
【密码】 (C语言代码)浏览:333 |
【数组的距离】 (C语言代码)浏览:728 |
母牛的故事 (C语言代码)浏览:435 |