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