1 static int wing=[]()
 2 {
 3     std::ios::sync_with_stdio(false);
 4     cin.tie(NULL);
 5     return 0;
 6 }();
 7 
 8 class Solution 
 9 {
10 public:
11     int findContentChildren(vector<int>& g, vector<int>& s) 
12     {
13         int szchild=g.size();
14         int szcookies=s.size();
15         if(szchild==0||szcookies==0)
16             return 0;
17         sort(g.begin(),g.end());
18         sort(s.begin(),s.end());
19         int indexchild=0,indexcookies=0;
20         int count=0;
21         while(indexchild<szchild&&indexcookies<szcookies)
22         {
23             if(s[indexcookies]>=g[indexchild])
24             {
25                 count++;
26                 indexcookies++;
27                 indexchild++;
28             }
29             else
30                 indexcookies++;
31         }
32         return count;
33     }
34 };

排个序,俩数组元素扫描比较即可。

posted on 2018-05-30 17:17  高数考了59  阅读(85)  评论(0)    收藏  举报