leetcode2

#include <iostream>
#include <vector>

using namespace std;

class Solution
{
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
    {
        vector<int> nums;
        int sum = nums1.size()+nums2.size();
        auto sentry1 = nums1.begin();
        auto sentry2 = nums2.begin();
        for (int count = 0;count<nums1.size()+nums2.size();++count)
        {
            if (sentry1==nums1.end())
            {
                nums.push_back(*sentry2);
                ++sentry2;
            }
            else if (sentry2==nums2.end())
            {
                nums.push_back(*sentry1);
                ++sentry1;
            }
            else if ((*sentry1)<(*sentry2))
            {
                nums.push_back(*sentry1);
                ++sentry1;
            }
            else
            {
                nums.push_back(*sentry2);
                ++sentry2;
            }
        }
        if (sum%2==1)
            return nums[sum/2];
        else
            return static_cast<double>(nums[sum/2-1]+nums[sum/2])/2;
    }
};

int main()
{
    Solution solo;
    vector<int> a{2,3};
    vector<int> b{1};
    cout << solo.findMedianSortedArrays(a,b);
}