int cmp(int* a,int* b){
return *a-*b;
}
int findContentChildren(int* g, int gSize, int* s, int sSize){
if(sSize == 0) return 0;
//排序
qsort(g,gSize,sizeof(int),cmp);
qsort(s,sSize,sizeof(int),cmp);
int count = 0;
int j = sSize - 1;
for(int i = gSize - 1;i >= 0;i--){
if(j >= 0 && s[j] >= g[i]){
j--;
count++;//统计满足个数
}
}
return count;
}
LeetCode:455. 分发饼干
最新推荐文章于 2024-09-16 06:54:08 发布