class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {

        int newSize = nums1.length + nums2.length;
        int[] newArray = new int[newSize];

        int nums1Pointer = 0;
        int nums2Pointer = 0;

        boolean nums1Stop = true;
        boolean nums2Stop = true;

        for (int i = 0; i < newArray.length; i++) {
            if (nums1Pointer == nums1.length - 1) {
                nums1Stop = false;
            }

            if (nums2Pointer == nums2.length - 1) {
                nums2Stop = false;
            }

            if (nums1Stop == false) {
                newArray[i] = nums2[nums2Pointer];
                nums2Pointer++;
            }

            if (nums2Stop == false) {
                newArray[i] = nums1[nums1Pointer];
                nums1Pointer++;
            }

            if (nums1[nums1Pointer] < nums2[nums2Pointer]) {
                newArray[i] = nums1[nums1Pointer];
                nums1Pointer++;
            } else {
                newArray[i] = nums2[nums2Pointer];
                nums2Pointer++;
            }
        }

        int med = newSize/2;
        if (newSize % 2 == 0) {
            return (double) (newArray[med] + newArray[med - 1])/2;
        }

        return (double) newArray[med];
    }
}