practice-questions/interval_list_intersection.cpp at master · apoorva-dave/practice-questions · 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
class Solution {
public:
    vector<vector<int>> intervalIntersection(vector<vector<int>>& A, vector<vector<int>>& B) {
        vector<vector <int>> res;
        int i=0, j=0;
        while(i<A.size() && j<B.size())
        {
            vector <int> curr;
            int l1 = A[i][0];
            int h1 = A[i][1];
            int l2 = B[j][0];
            int h2 = B[j][1];
            // cout<<l1<<" "<<l2<<" "<<h1<<" "<<h2<<endl;
            if(l2 <= h1 && h1 <= h2)
            {
                cout<<l2<<" "<<h1<<endl;
                if(l1 <= l2)
                {
                    curr.push_back(l2);
                    curr.push_back(h1);
                }
                else
                {
                    curr.push_back(l1);
                    curr.push_back(h1);
                }
                res.push_back(curr);
                i++;
            }
            else if(h1 >= h2)
            {
                cout<<l1<<" "<<h2<<endl;
                if(l1 <= h2)
                {
                    if(l1 <= l2)
                    {
                        curr.push_back(l2);
                        curr.push_back(h2);
                    }
                    else
                    {
                        curr.push_back(l1);
                        curr.push_back(h2);
                    }
                    res.push_back(curr);
                }
                j++;
            }
            else
            {
                if(l1<=l2 && h1<=h2)
                    i++;
                else if(l2<=l1 && h2<=h1)
                    j++;
                else
                {
                    i++;
                    j++;
                }
            }
        }
        return res;
    }
};


/*
class Solution {
public:
    vector<vector<int>> intervalIntersection(vector<vector<int>>& A, vector<vector<int>>& B)
    {
        vector<vector<int>> v{};
        for(int i=0, j=0; i<A.size() && j<B.size();){
            int start = max(A[i][0], B[j][0]);
            int end = min(A[i][1], B[j][1]);
            if(start<=end) v.push_back(vector<int>{start, end});
            if(A[i][1]<B[j][1]) ++i;
            else ++j;
        }
        return v;
    }
};


*/