Remember a company interview question: merge ordered arrays

source

2021/09/24： Received an interview from a company , Tear one by hand to the problem of merging ordered arrays , At that time, it was almost done , The time given by the interviewer is relatively short , There is a problem with the critical value processing , It's a pity that I didn't write it out completely , But at least I have the right idea , Refer to the information on the Internet , Now we have sorted out a better solution , I just wrote some test cases , If there is an error , Please correct me ！
No more specific topics , Just look at the title

Code up

package com.vleus.algorithm.strings;

import java.util.Arrays;

/** * @author vleus * @date 2021 year 09 month 24 Japan  19:50 */
public class Solution {
    


    // Two ordered arrays , Merge into an ordered array , The required time complexity is O（n）
    public static int[] getNewArr(int[] arr1, int[] arr2) {
    

        if (arr1.length == 0) {
    
            return arr2;
        }

        if (arr2.length == 0) {
    
            return arr1;
        }

        int i = 0;
        int j = 0;
        int[] newArr = new int[arr1.length + arr2.length];

        for (int k = 0; k < newArr.length; k++) {
    

            if (arr1[i] < arr2[j] && i <= arr1.length - 1) {
    
                newArr[k] = arr1[i];
                i++;
                continue;
            }

            if (arr1[i] >= arr2[j] && j <= arr2.length - 1) {
    
                newArr[k] = arr2[j];
                j++;
                continue;
            }
        }

        return newArr;
    }

    public static int[] getNewArr2(int[] arr1, int[] arr2) {
    

        int i = arr1.length + arr2.length - 1;
        int i1 = arr1.length - 1;
        int i2 = arr2.length - 1;
        int[] newArr = new int[arr1.length+arr2.length];

        while (i1 >= 0 && i2 >= 0) {
    
            if (arr1[i1] >= arr2[i2]) {
    
                newArr[i] = arr1[i1];
                i1--;
                i--;
            }else{
    
                newArr[i] = arr2[i2];
                i2--;
                i--;
            }
        }

        if(i1 >= 0){
    
            System.arraycopy(arr1,0,newArr,i1,i1+1);
        }

        if (i2 >= 0) {
    
            System.arraycopy(arr2,0,newArr,i2,i2+1);
        }

        return newArr;
    }

    public static void main(String[] args) {
    

        int[] arr1 = new int[]{
    1, 3, 5, 7, 7, 8,12};
        int[] arr2 = new int[]{
    2, 4, 6, 8, 8};

        int[] newArr2 = getNewArr2(arr1, arr2);

        System.out.println(Arrays.toString(newArr2));

    }
}