解题思路:
注意事项:
参考代码:
import java.util.Arrays; import java.util.Scanner; public class C1606 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int n = sc.nextInt(); int[] a = new int[n]; for(int i = 0; i < n; i++) a[i] = sc.nextInt(); Arrays.sort(a); int m = sc.nextInt(); int[] b = new int[m]; for(int i = 0; i < m; i++) b[i] = sc.nextInt(); Arrays.sort(b); //交集 StringBuffer sb = new StringBuffer(); for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(a[i] == b[j]){ sb.append(a[i] + " "); break; } } } if(sb.length() > 0) System.out.println(sb.substring(0, sb.length()-1)); //并集 sb = new StringBuffer(); int ia = 0, ib = 0; while(ia < n && ib < m){ if(a[ia] < b[ib]) sb.append(a[ia++] + " "); else if(a[ia] > b[ib]) sb.append(b[ib++] + " "); else{ sb.append(a[ia++] + " "); ib++; } } while(ia < n){ sb.append(a[ia++] + " "); } while(ib < m){ sb.append(b[ib++] + " "); } if(sb.length() > 0) System.out.println(sb.substring(0, sb.length()-1)); //余集 sb = new StringBuffer(); for(int i = 0; i < n; i++){ boolean flag = true; for(int j = 0; j < m; j++){ if(a[i] == b[j]){ flag = false; break; } } if(flag) sb.append(a[i] + " "); } if(sb.length() > 0) System.out.println(sb.substring(0, sb.length()-1)); } sc.close(); } }
0.0分
0 人评分
母牛的故事 (C语言代码)浏览:1716 |
C语言训练-计算1~N之间所有奇数之和 (C语言代码)浏览:721 |
C二级辅导-公约公倍 (C语言代码)浏览:2123 |
简单的a+b (C语言代码)浏览:494 |
C语言训练-计算1977!* (C++代码)浏览:859 |
C语言程序设计教程(第三版)课后习题9.8 (Java代码)浏览:1642 |
WU-蓝桥杯算法提高VIP-勾股数 (C++代码)浏览:1607 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:476 |
C语言程序设计教程(第三版)课后习题3.7 (C语言代码)浏览:842 |
Hello, world! (C++代码)浏览:1744 |