贪心算法-455 

 1 int cmp(const void *a, const void *b)
 2 {
 3     int *p = (int*)a, *q = (int *)b;
 4     return *p - *q;
 5 }
 6 int findContentChildren(int* g, int gSize, int* s, int sSize){
 7     qsort(g, gSize, sizeof(int), cmp);
 8     qsort(s, sSize, sizeof(int), cmp);
 9     int child = 0, cookie = 0;
10     while (child < gSize && cookie < sSize)
11     {
12         if (g[child] <= s[cookie])
13         {
14             child++;
15         }
16         cookie++;
17     }
18     return child;
19 }

 

posted @ 2022-07-10 16:10  ainingxiaoguai  阅读(27)  评论(0)  编辑  收藏  举报