MedianofSortedArrays.java

// Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

// The overall run time complexity should be O(log (m+n))


// Input: nums1 = [1,3], nums2 = [2]
// Output: 2.00000
// Explanation: merged array = [1,2,3] and median is 2.
 
// Input: nums1 = [1,2], nums2 = [3,4]
// Output: 2.50000
// Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

import java.util.Arrays;
class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        
            int median=0;
            double ress = median;

           
        
            int thirdArray[]= new int[(nums1.length) + (nums2.length)];

            for(int i=0;i<nums1.length;i++)
            {
                thirdArray[i]=nums1[i];
            }
            for(int i=0;i<nums2.length;i++)
            {
                thirdArray[i+nums1.length]=nums2[i];

            }
        Arrays.sort(thirdArray);
        
                if(thirdArray.length%2==1)
            {   
                ress=(thirdArray[((thirdArray.length)/2)]);
            }
            else
            {
                ress=((thirdArray[((thirdArray.length)/2)])+(thirdArray[(((thirdArray.length)/2)-1)]))/2.0;
               
            }


          return ress;
            

        }
    
    }