Leetcode No.4 寻找两个正序数组的中位数

package find_median_sorted_arrays;

public class Solution {
    public int[] merge(int[] nums1, int[] nums2){
        int len1=nums1.length;
        int len2=nums2.length;
        int len3=len1+len2;
        int[] nums3=new int[len3];
        int i=0,j=0,k=0;
        while(i<len1&&j<len2){
            int num1=nums1[i];
            int num2=nums2[j];
            if (num1>num2){
                nums3[k++]=num2;
                j++;
            }else{
                nums3[k++]=num1;
                i++;
            }
        }
        while(i<len1){
            nums3[k+