Leetcode/Mean_of_sorted.cpp at main · Sudhanshu3011/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class Solution
{
public:
    double findMedianSortedArrays(vector<int> &nums1, vector<int> &nums2)
    {

        vector<int> merged;
        int i = 0, j = 0, n;
        double value;
        while (i < nums1.size() && j < nums2.size())
        {
            if (nums1[i] < nums2[j])
            {
                merged.push_back(nums1[i]);
                i++;
            }
            else
            {
                merged.push_back(nums2[j]);
                j++;
            }
        }
        while (i < nums1.size())
        {
            merged.push_back(nums1[i]);
            i++;
        }
        while (j < nums2.size())
        {
            merged.push_back(nums2[j]);
            j++;
        }

        int size = merged.size();
        n = (size / 2);

        if (size % 2 == 0)
        {

            value = (merged[n] + merged[n - 1]) / 2.0;
        }
        else
        {
            value = merged[n];
        }

        return value;
    }
};