磕代码：java：合并有序数组

方法一：没有人比我更懂for循环

import java.io.*;
import java.util.*;
//6.10
public class Main{
    public static void main(String[]args)throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int[]arr1={1,3,7};
        int[]arr2={1,4,6,8};
        int m=arr1.length;
        int n=arr2.length;
        int[]arr=new int[m+n];
       
        for(int i=0;i<m;i++){
            arr[i]=arr1[i];
        }
        for(int j=0;j<n;j++){
            arr[j+m]=arr2[j];
        }
        Arrays.sort(arr);
        
        System.out.println(Arrays.toString(arr));
    }
}

方法二：常规思路

import java.io.*;
import java.util.*;
//6.10
public class Main{
    public static void main(String[]args)throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int[]arr1={1,3,7};
        int[]arr2={1,4,6,8};
        int m=arr1.length;
        int n=arr2.length;
        int[]arr=new int[m+n];
        int i=0,j=0,k=0;
        
        while(i<m&&j<n){
            if(arr1[i]<=arr2[j]){
                arr[k]=arr1[i];
                i++;
                k++;
            }else{
                arr[k]=arr2[j];
                j++;
                k++;
            }
        }
        while(i<m){
            arr[k]=arr1[i];
            i++;
            k++;
        }
        while(j<n){
            arr[k]=arr2[j];
            j++;
            k++;
        }
        System.out.println(Arrays.toString(arr));
    }
}