LeetCode第4题

LeetCode第4题

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len1 = nums1.length;
        int len2 = nums2.length;
        int[] resArr = new int[len1+len2];
        int point_1 = 0;
        int point_2 = 0;
        int point_res = 0;
        while(point_1 < len1 && point_2 < len2) {
            if(nums1[point_1] < nums2[point_2]) {
                resArr[point_res] = nums1[point_1];
                point_1++;
				point_res++;
            }else {
                resArr[point_res] = nums2[point_2];
                point_2++;
                point_res++;
            }
        }
        
        if(point_1 == len1 && point_2 < len2) {
            while(point_2 < len2) {
                resArr[point_res] = nums2[point_2];
                point_2++;
                point_res++;
            }
			}else if(point_2 == len2 && point_1 < len1) {
            while(point_1 < len1) {
                resArr[point_res] = nums1[point_1];
                point_1++;
                point_res++;
            }
        }
        int len = resArr.length;
        if(len % 2 == 0) {
            return ((double)resArr[len/2]+(double)resArr[len/2-1])/2;
        }else {
            return (double)resArr[len/2];
        }
    }
}

执行结果