4. Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0

Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len1=nums1.length;
        int len2=nums2.length;
        int []num1and2=new int[len1+len2];
         
        for(int i=0,j=0,count=0;count<(len1+len2);count++)
        {
            if(j>=len2&&i<len1)
            {
                num1and2[count]=nums1[i];
                i++;
            }
            if(i>=len1&&j<len2)
            {
                num1and2[count]=nums2[j];
                j++;
            }
            if(i<len1&&j<len2)
            {
                    if(nums1[i]<nums2[j])
                    {
                       num1and2[count]=nums1[i];
                       i++;
                    }
                   else
                   {
                      num1and2[count]=nums2[j];
                      j++;
                  }
            }

        }
        if(num1and2.length%2==0)
            return (num1and2[num1and2.length/2]+num1and2[num1and2.length/2-1])/2.0;
        else
            return num1and2[num1and2.length/2];
    }
}