class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int[] allArray = new int[nums1.length + nums2.length];
for (int i = 0; i <= nums1.length - 1; i++)
allArray[i] = nums1[i];
for (int j = 0; j <= nums2.length - 1; j++)
allArray[j + nums1.length] = nums2[j];
Arrays.sort(allArray);
if (allArray.length % 2 == 1) {
return allArray[allArray.length/2];
}
else {
return (allArray[allArray.length/2 - 1] + allArray[allArray.length/2])/2.0;
}
}
}