Leetcode 4 Median of Two Sorted Arrays Solution in Java | Hindi Coding Community

 

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

The overall run time complexity should be O(log (m+n)).

Example 1:

Input: nums1 = [1,3], nums2 = [2]

Output: 2.00000

Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]

Output: 2.50000

Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

 

Constraints:

nums1.length == m

nums2.length == n

0 <= m <= 1000

0 <= n <= 1000

1 <= m + n <= 2000

-106 <= nums1[i], nums2[i] <= 106

class Solution {

public double findMedianSortedArrays(int[] nums1, int[] nums2) {

int[] mergedArr = new int[nums1.length + nums2.length];

int i = nums1.length - 1, j = nums2.length - 1, k = mergedArr.length;

while (k > 0) {

mergedArr[--k] =

(j < 0 || (i >= 0 && nums1[i] >= nums2[j])) ? nums1[i--] : nums2[j--];

}

int size = mergedArr.length;

int mid = size/2;

if(size%2==0) {

return Double.valueOf((mergedArr[mid-1]+mergedArr[mid]))/2;

} else {

return mergedArr[mid];

}

}

}