蓝桥杯算法提高VIP-数组替换 （Java代码）

解题思路:
直接输出即可
注意事项:

参考代码:

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

int n=input.nextInt(),m=input.nextInt();

int a[]=new int[n];

int b[]=new int[m];

for (int i = 0; i <n; i++) {

a[i]=input.nextInt();

}

for (int i = 0; i <m; i++) {

b[i]=input.nextInt();

}

int k=input.nextInt(),q=input.nextInt();

if(q==0){

for (int i = 0; i <n-1; i++) {

System.out.print(a[i]+",");

}

System.out.print(a[n-1]);

return;

}

for (int i = 0; i <k+q-1; i++) {

if(i<k)

System.out.print(a[i]+",");

else{

System.out.print(b[i-k]+",");

}

}

if(k+q>=n){

System.out.println(b[q-1]);

}

else{

System.out.print(b[q-1]+",");

for (int i = k+q; i <n-1; i++) {

System.out.print(a[i]+",");

}

System.out.print(a[n-1]);

}

}

}