455.Assign Cookies
Description
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.
Note
You may assume the greed factor is always positive.
You cannot assign more than one cookie to one child.
Example 1:
Input: [1,2,3], [1,1]
Output: 1
Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.
Example 2:
Input: [1,2], [1,2,3]
Output: 2
Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
You have 3 cookies and their sizes are big enough to gratify all of the children,
You need to output 2.
分析
应用贪心算法:在分饼干时,饼干的大小在能使孩子满足的前提下尽可能小,即饼干的大小尽可能与小孩子的心里期待接近。
因此先将饼干和孩子的心理期待分别按照从小到大重新排序,然后一个个匹对即可。
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int i = 0, j = 0;
while(i < s.size() && j < g.size()) {
if (s[i] >= g[j]) {
++j;
}
++i;
}
return j;
}
};
复杂度分析
时间复杂度:O(nlogn)。时间主要消耗在排序上,sort函数用的是改进的快排算法,时间复杂度仍为nlogn。
空间复杂度:O(1)。