贪心算法-435

int cmp(const void ** a, const void **b)
{
    int **p = (int **)a, **q = (int **)b;
    return (*p)[1] - (*q)[1];
}

int eraseOverlapIntervals(int** intervals, int intervalsSize, int* intervalsColSize){
    qsort(intervals, intervalsSize, sizeof(int *), cmp);

    int max = 1;
    int right = intervals[0][1];
    for (int i = 1; i < intervalsSize; i++)
    {
        if (intervals[i][0] >= right)
        {
            max++;
            right = intervals[i][1];
        }
    }
    return intervalsSize - max;
}