zoukankan      html  css  js  c++  java
  • 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 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.

    先排序,后贪心,时间复杂度为O(nlogn)

     public int findContentChildren(int[] g, int[] s) {//贪心 my
           int n=0;
            Arrays.sort(g);
            Arrays.sort(s);
            int j = 0;//s
            int i=0;//g
            while(i<g.length&&j<s.length){
                if(g[i]<=s[j]){
                    n++;
                    i++;
                    j++;
                }
                else{
                    j++;
                }
            }
            return n; 
        }
  • 相关阅读:
    [LuoguP2161] 会场预约
    [LuoguP1198] 最大数
    [LuoguP1484] 种树
    [LuoguP1801] 黑匣子
    [LuoguP1196]银河英雄传说
    [LuoguP1345] 奶牛的电信Telecowmunication
    [LuoguP1119]灾后重建
    【笔记】一元函数微分学
    【复习】Listening and Reading Comprehension
    【笔记】一元函数的不定积分
  • 原文地址:https://www.cnblogs.com/zhacai/p/10596709.html
Copyright © 2011-2022 走看看