455. 分发饼干
LeetCode链接
#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
int findContentChildren(vector<int>& g, vector<int>& s)
{
sort(g.begin(),g.end(),greater<int>());
sort(s.begin(),s.end(),greater<int>());
int max = 0;
int cookNum = s.size();
int index = 0;
for(int i = 0; i < g.size();i++)
{
if(index < cookNum && s[index] >= g[i])
{
max++;
index++;
}
}
return max;
}
void test()
{
vector<int> g={1,2,3};
vector<int> s={3};
int child = findContentChildren(g,s);
cout << "child: " << child << endl;
}
int main()
{
cout << "hello world\n";
test();
}