4. Median of Two Sorted Arrays

Runtime  2 ms
Beats    99.49%


Memory   44.8 MB
Beats    38.63%


class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
                int  arr[]=new int[nums1.length+nums2.length];
                int i=0,j=0;
                int ind=0;;
                while(i<nums1.length && j<nums2.length)
                {
                    if(nums1[i]<nums2[j]){
                        arr[ind++]=nums1[i];
                        i++;
                    }
                    else{
                        arr[ind++]=nums2[j];
                        j++;
                    }
                }
                while(i<nums1.length){
                    arr[ind++]=nums1[i];
                    i++;
                }
                while(j<nums2.length){
                    arr[ind++]=nums2[j];
                    j++;
                }
                int len=arr.length;
                if(len%2!=0){
                    return (double)arr[len/2];
                }
                else{
                    return (double)(arr[len/2]+arr[(len/2)-1])/2;
                }
    }
}