import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int m = input.nextInt(); int n = input.nextInt(); int[] a = new int[m + n]; for (int i = 0; i < m + n; i++) { if (i < m) { a[i] = input.nextInt(); } else { a[i] = 0; } } int[] b = new int[n]; for (int i = 0; i < n; i++) { b[i] = input.nextInt(); } int m1 = input.nextInt(); int n1 = input.nextInt(); if (n1 == 0) // 当n1为0时 ,输出a 数组; { for (int i = 0; i < m; i++) { if (i == 0) { System.out.print(a[i]); } else { System.out.print("," + a[i]); } } } else { Add(a, m1, b, n1); } } public static void Add(int a[], int m1, int b[], int n1) { int[] c = new int[n1]; int x = m1 + n1; for (int i = 0; i < n1; i++) { c[i] = b[i]; } for (int i = 0; i < n1; i++) { if (m1 < x) { a[m1] = c[i]; m1++; } } for (int i = 0; i < x; i++) { if (i == 0) { System.out.print(a[i]); } else { System.out.print("," + a[i]); } } } }
解题思路:
正常思路, 注意n1 为零的时候, 直接输出a数组;
注意事项:
参考代码:
0.0分
0 人评分
小九九 (C语言代码)浏览:825 |
简单编码 (C++代码)浏览:678 |
Hello, world! (C语言代码)浏览:1212 |
简单的a+b (C语言代码)浏览:544 |
C语言程序设计教程(第三版)课后习题8.9 (Java代码)浏览:1339 |
【绝对值排序】 (C++代码)浏览:673 |
Pascal三角 (C语言代码)浏览:1189 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:526 |
C语言程序设计教程(第三版)课后习题7.5 (C语言代码)浏览:524 |
C语言训练-列出最简真分数序列* (C语言代码)浏览:619 |