![在这里插入图片描述](https://img-blog.csdnimg.cn/20210114155957828.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1MTAwMzYx,size_16,color_FFFFFF,t_70)
我采用的是合并数组的解法
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int len1 = nums1.length;
int len2 = nums2.length;
int[] arr = new int[len1 + len2];
int p1 = 0;
int p2 = 0;
int p3 = 0;
while(p1 < len1 && p2 < len2) {
if(nums1[p1] < nums2[p2]) {
arr[p3++] = nums1[p1++];
}else{
arr[p3++] = nums2[p2++];
}
}
while(p1 < len1) {
arr[p3++] = nums1[p1++];
}
while(p2 < len2) {
arr[p3++] = nums2[p2++];
}
if(arr.length % 2 == 1) {
return (double)arr[(arr.length - 1) / 2];
}else{
int t = (arr.length - 1) / 2;
return (double)(arr[t] + arr[t + 1]) / 2;
}
}
}