leetcode 第4题 Median of Two Sorted Arrays

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2){
        vector<int> nums;
        if (nums1.size() > nums2.size()){
            nums = nums1;
            for (unsigned int i = 0; i < nums2.size(); ++i){
                nums.push_back(nums2[i]);
            }
        }
        else{
            nums = nums2;
            for (unsigned int i = 0; i < nums1.size(); ++i){
                nums.push_back(nums1[i]);
            }
        }
        sort(nums.begin(), nums.end());
        if (nums.size() & true){
            return nums[nums.size() / 2];
        }
        else{
            return (nums[nums.size() / 2] + nums[(nums.size() / 2) - 1]) / 2.0;
        }
    }
};

看起来很难，但其实原理很简单。