25. 두 배열 합치기

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {

    public ArrayList<Integer> solution(int n, int m, int[] arr1, int[] arr2) {
        ArrayList<Integer> answer = new ArrayList<>();

        int p1 = 0, p2 = 0;
        while (p1 < n && p2 < m) {
            if(arr1[p1] < arr2[p2]) answer.add(arr1[p1++]); //p1의 값 먼저 add하고 1증가
            else answer.add(arr2[p2++]);
        }
        while(p1<n) answer.add(arr1[p1++]);
        while(p2<m) answer.add(arr2[p2++]);
        return answer;
    }
   public static void main(String[] args){
       Main T = new Main();
       Scanner kb = new Scanner(System.in);
       int n = kb.nextInt();
       int[] arr1 = new int[n];
       for (int i = 0; i < n; i++) {
           arr1[i] = kb.nextInt();
       }
       int m = kb.nextInt();
       int[] arr2 = new int[m];
       for (int i = 0; i < m; i++) {
           arr2[i] = kb.nextInt();
       }
       for (int x : T.solution(n, m, arr1, arr2)) System.out.print(x + " ");
   }
}