class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int arr[] = new int[nums1.length + nums2.length];


        int a = 0;
        int b = 0;
        int i = 0;
        while( a < nums1.length && b < nums2.length){
            if(nums1[a] <= nums2[b]){
                arr[i] = nums1[a];
                a++;
            }
            else{
                arr[i] = nums2[b];
                b++;
            }
            i++;
        }

        while(a < nums1.length){
            arr[i] = nums1[a];
            i++;
            a++;
        }

         while(b < nums2.length){
            arr[i] = nums2[b];
            i++;
            b++;
        }

        if(arr.length % 2 == 1){
            return (double) arr[arr.length / 2];
        }
        else{
            int m1 = arr[(arr.length / 2) - 1];
            int m2 = arr[(arr.length / 2)];
            return (double) (m1 + m2) / 2;
        }
    }
}