参考代码:
public void reorder1() { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); int count = 1; String str = arr[0]+" "; for (int i = 1; i < n; i++) { if (arr[i] != arr[i - 1]){ str += arr[i]+" "; count++; } } System.out.println(count); System.out.println(str.substring(0,str.length()-1)); } public void reorder2() { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ Set<Integer> set = new TreeSet<>(); int n = sc.nextInt(); while(n-- > 0){ set.add(sc.nextInt()); } StringBuffer sb = new StringBuffer(); Iterator<Integer> iterator = set.iterator(); while(iterator.hasNext()){ sb.append(iterator.next() + " "); } //打印结果 System.out.println(set.size()); System.out.println(sb.substring(0, sb.length()-1)); } } public void reorder3() { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = scanner.nextInt(); } String b = ""; for (int i = 0; i < arr.length; i++) { boolean flag = true; for (int j = i - 1; j >= 0; j--) { if (arr[i] == arr[j]) { flag = false; } } if (flag == true) { b += arr[i] + " "; } } String[] bs = b.split(" "); int[] p = new int[bs.length]; for (int i = 0; i < bs.length; i++) { p[i] = Integer.parseInt(bs[i]); } Arrays.sort(p); System.out.println(p.length); for (int i = 0; i < p.length; i++) { System.out.print(p[i] + " "); } }
0.0分
0 人评分
模拟计算器 (C语言代码)浏览:882 |
C二级辅导-统计字符 (C语言代码)浏览:503 |
2004年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:500 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:780 |
C语言程序设计教程(第三版)课后习题9.10 (C语言代码)浏览:820 |
数字游戏 (C++代码)浏览:1180 |
2003年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:511 |
C二级辅导-分段函数 (C语言代码)浏览:593 |
C二级辅导-阶乘数列 (C语言代码)浏览:508 |
钟神赛车 (C语言代码)浏览:594 |