455. Assign Cookies - LeetCode

Question

455. Assign Cookies

Solution

题目大意:数组g的大小表示有几个小孩,每个元素表示小孩的食量,数组s的大小表示有多少个饼干,每个元素的大小表示每个饼干的大小,把饼干分给小孩,每个小孩只能分一个饼干,问最多能满足多少个小孩.

思路:遍历小孩,为每个小孩遍历饼干

Java实现:

public int findContentChildren(int[] g, int[] s) {
    int ans = 0;
    Arrays.sort(s);
    for (int i = 0; i < g.length; i++) {
        for (int j = 0; j < s.length; j++) {
            if (g[i] <= s[j]) {
                s[j] = -1;
                ans ++;
                break;
            }
        }
    }
    return ans;
}

优化:先把小孩和饼干排序,再遍历

public int findContentChildren(int[] g, int[] s) {
    Arrays.sort(g);
    Arrays.sort(s);
    int ans = 0;
    int i=0;
    int j=0;
    while (i<g.length && j < s.length) {
        if (g[i] <= s[j]) {
            s[j] = -1;
            ans ++;
            i++;
        }
        j++;
    }
    return ans;
}

原文地址:https://www.cnblogs.com/okokabcd/p/9270639.html

时间: 2024-10-10 15:34:59

455. Assign Cookies - LeetCode的相关文章

[leetcode greedy]455. Assign Cookies

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

LeetCode 455. Assign Cookies (分发曲奇饼干)

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

LeetCode &quot;455. Assign Cookies&quot;

Simple greedy thought .. satify each kid with minimum qualified cookie, from the least greedy kid.. class Solution { public: int findContentChildren(vector<int>& g, vector<int>& s) { int ng = g.size(); int ns = s.size(); sort(g.begin()

455. Assign Cookies Add to List

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

455. Assign Cookies

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

455 Assign Cookies 分发饼干

假设你是一位很棒的家长,想要给你的孩子们一些小饼干.但是,每个孩子最多只能给一块饼干.对每个孩子 i ,都有一个胃口值 gi ,这是能让孩子们满足胃口的饼干的最小尺寸:并且每块饼干 j ,都有一个尺寸 sj .如果 sj >= gi ,我们可以将这个饼干 j 分配给孩子 i ,这个孩子会得到满足.你的目标是尽可能满足越多数量的孩子,并输出这个最大数值.注意:你可以假设胃口值为正.一个小朋友最多只能拥有一块饼干.示例 1:输入: [1,2,3], [1,1]输出: 1解释: 你有三个孩子和两块小饼

Leetcode: Assign Cookies

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

[LeetCode] 455. Assign Cookies_Easy tag: Sort

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

LeetCode题解之 Assign Cookies

1.题目描述 2.问题分析 使用贪心算法. 3 代码 1 class Solution { 2 public: 3 4 int findContentChildren(vector<int>& g, vector<int>& s) { 5 int nums = 0; 6 sort(g.begin(), g.end()); 7 sort(s.begin(), s.end()); 8 9 vector<int>::iterator its = s.begin