Median of Two Sorted Arrays_leetcode_#4

1.题目
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)).

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

2.解法

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        int m = nums1.size();
        int n = nums2.size();
        int total = m + n;
        if (total % 2 == 1){
            return finder(nums1, nums2, m, n, total/2 + 1, 0, 0);
        }
        else{
            return (finder(nums1, nums2, m, n, total/2, 0, 0) + finder(nums1, nums2, m, n, total/2 + 1, 0, 0)) / 2;
        }
    }

    double finder(vector<int>nums1, vector<int> nums2, int len1, int len2, int k, int start1, int start2){
        if (len1 > len2){
            return finder(nums2, nums1, len2, len1, k, start2, start1);
        }
        if (len1 == 0){
            return nums2[start2 + k - 1];
        }
        if(k == 1){
            return min(nums1[start1], nums2[start2]);
        }
        int a = min(k / 2, len1);
        int b = k - a;
        if (nums1[start1 + a - 1] <= nums2[start2 + b - 1]){
            return finder(nums1, nums2, len1 - a, len2, k - a, start1+a, start2);
        }
        else{
            return finder(nums1, nums2, len1, len2 - b, k - b, start1, start2 + b);         
        }
    }
};