classSolution{publicdoublefindMedianSortedArrays(int[]nums1,int[]nums2){doublemedian=0.0;intm=nums1.length;intn=nums2.length;intcombinedArr[]=newint[m+n];inti=0,j=0,k=0;while(i<m&&j<n){if(nums1[i]<=nums2[j]){combinedArr[k]=nums1[i++];}else{combinedArr[k]=nums2[j++];}k++;}while(i<m){combinedArr[k]=nums1[i];i++;k++;}while(j<n){combinedArr[k]=nums2[j];j++;k++;}if(combinedArr.length%2==0){median=(combinedArr[(combinedArr.length/2)-1]+combinedArr[combinedArr.length/2])/2.0;}else{median=(combinedArr[combinedArr.length/2])/1.0;}returnmedian;}}

# This solution is for python3, may or may not work for other versionsclassSolution:deffindMedianSortedArrays(self,nums1:List[int],nums2:List[int])->float:nums3=nums1+nums2nums3.sort()iflen(nums3)%2!=0:returnnums3[(len(nums3)//2)]else:return(nums3[(len(nums3)//2)-1]+nums3[(len(nums3)//2)])/2