4. Median of Two Sorted Arrays

Problem Description: 

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

You may assume nums1 and nums2 cannot be both empty.

Example 1:

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

The median is 2.0

Example 2:

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

The median is (2 + 3)/2 = 2.5

Analysis:

With the given two sorted arrays, the way to find the median of the two arrays is to count. The difficult thing is to think about the odd and even number of the two arrays elements. 

Code:

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int len1 = nums1.length;
        int len2 = nums2.length;
        
        int cnt = (len1 + len2) / 2;
        int i = 0, j = 0;
        int tmp = 0;
        int tmp_even = 0;
        while(cnt >= 0 && (i < len1 || j < len2)) {
            if(i < len1 && j < len2) {
                if(nums1[i] < nums2[j]) {
                    tmp = nums1[i++];
                } else {
                    tmp = nums2[j++];
                }
            } else if(i < len1) {
                tmp = nums1[i++];
            } else if(j < len2) {
                tmp = nums2[j++];
            } 
            if(cnt < 2) {
                if((len1 + len2)%2 == 0) {
                    tmp_even += tmp;
                    //System.out.println("test: " + tmp_even);    
                } else if(cnt == 0) {
                    return (double)tmp;
                }       
            }
            cnt--;
        }
        return (double)tmp_even/2;
    }
}