Leetcode-986 Interval List Intersections(区间列表的交集)

bool  cmp(Interval a,Interval b)
{
    return a.start<b.start;
}
class Solution
{
    public:

        vector<Interval> intervalIntersection(vector<Interval>& A, vector<Interval>& B)
        {
            vector<Interval> rnt;
            for(int i = 0; i < A.size(); i ++)
            {
                for(int j = 0; j < B.size(); j ++)
                {
                    if(A[i].start>=B[j].start&&A[i].start<=B[j].end&&A[i].end<=B[j].end)
                    {
                        Interval tmp(A[i].start,A[i].end);
                        rnt.push_back(tmp);
                    }
                    else if(A[i].start>=B[j].start&&A[i].start<=B[j].end&&A[i].end>B[j].end)
                    {
                        Interval tmp(A[i].start,B[j].end);
                        rnt.push_back(tmp);
                    }
                    else if(B[j].start>=A[i].start&&B[j].start<=A[i].end&&B[j].end>A[i].end)
                    {
                        Interval tmp(B[j].start,A[i].end);
                        rnt.push_back(tmp);
                    }
                    else if(B[j].start>=A[i].start&&B[j].start<=A[i].end&&B[j].end<=A[i].end)
                    {
                        Interval tmp(B[j].start,B[j].end);
                        rnt.push_back(tmp);
                    }
                }
            }
            sort(rnt.begin(),rnt.end(),cmp);
            return rnt;
        }
};