DSA/findMedianSortedArrays.cpp at master · deceiverdd/DSA · 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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
#include <cstring>
#include <string>
#include <time.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>

using namespace std;

double findMedianSortedArrays(vector<int> &nums1, vector<int> &nums2)
{
    int i, j = 0;
    vector<int> q;

    int totalLength = nums1.size() + nums2.size();
    int mid = totalLength / 2;

    while (i < nums1.size() || j < nums2.size())
    {
        if (i >= nums1.size())
        {
            q.push_back(nums2[j]);
            j++;
            continue;
        }

        if (j >= nums2.size())
        {
            q.push_back(nums1[i]);
            i++;
            continue;
        }

        if (nums1[i] <= nums2[j])
        {
            q.push_back(nums1[i]);
            i++;
        }
        else
        {
            q.push_back(nums2[j]);
            j++;
        }

        if (i + j - 1 == mid)
        {
            if (totalLength % 2 != 0)
            {
                return q.back();
            }
            else
            {
                return (q.at(q.size() - 1) + q.at(q.size() - 2))/2.0;
            }
        }
    }

    return 0.0;
}

double findMedianSortedArrays1(vector<int>& nums1, vector<int>& nums2)
{
            int i,j = 0;
    vector<int> q;

    while(i < nums1.size() || j < nums2.size())
    {
        if(i >= nums1.size())
        {
            q.push_back(nums2[j]);
            j++;
            continue;
        }

        if(j >= nums2.size())
        {
            q.push_back(nums1[i]);
            i++;
            continue;
        }


        if(nums1[i] <= nums2[j])
        {
            q.push_back(nums1[i]);
            i++;
        }
        else
        {
            q.push_back(nums2[j]);
            j++;
        }
    }

    int r = q.size()/2;

    if(q.size()%2 == 0)
    {
        return (q[r] + q[r-1])/2.0;
    }
    else
    {
        return q[r];
    }
}

int main(int argc, char const *argv[])
{
    vector<int> a = {2};

    vector<int> b;

    //double result = findMedianSortedArrays(a, b);

    //cout << result << endl;

    cout << b.size() << endl;

    return 0;
}