C语言 | Leetcode C语言题解之第452题用最少数量的箭引爆气球
题目:
题解:
int cmp(void* _a, void* _b) {
int *a = *(int**)_a, *b = *(int**)_b;
return a[1] < b[1] ? -1 : 1;
}
int findMinArrowShots(int** points, int pointsSize, int* pointsColSize) {
if (!pointsSize) {
return 0;
}
qsort(points, pointsSize, sizeof(int*), cmp);
int pos = points[0][1];
int ans = 1;
for (int i = 0; i < pointsSize; ++i) {
if (points[i][0] > pos) {
pos = points[i][1];
++ans;
}
}
return ans;
}
原文地址:https://blog.csdn.net/m0_59237910/article/details/142688140
免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!