Leetcode452题 引爆气球

int cmp(const void* a, const void* b){//右侧排序，保证必定有重复的部分
                                        //左侧排序的话，个人认为应该用降序
    int *x1 = *(int **)a;
    int *x2 = *(int **)b;
    if(x1[1] > x2[1])return 1;
    else return -1;
}



int findMinArrowShots(int** points, int pointsSize, int* pointsColSize){
    if(pointsSize == 1) return 1;
    qsort(points, pointsSize, sizeof(int*), cmp);
    int count = 1;
    int right = points[0][1];
    for(int i = 1;i < pointsSize; ++i){
        if(points[i][0] > right){
            count++;
            right = points[i][1];
        }
    }
    return count;
}