力扣刷题记录 -- JAVA--77---455. 分发饼干

---

一、题目

二、代码

class Solution 
{
    //让大饼干尽可能满足大孩子的需求

    public int findContentChildren(int[] g, int[] s) 
    {

        int re_num = 0;
        Arrays.sort(g);
        Arrays.sort(s);


        int i ;
        int length;
        int index_s;
        int index_g;

        index_g = g.length-1;
        index_s = s.length-1;

        while(index_s>=0&&index_g>=0)
        {
           if(s[index_s]>=g[index_g])
           {
               re_num++;
               index_s--;
           }
           index_g--;   
        }
            
        
        return re_num; 

    }
}

三、运行结果

四、附录

二刷

class Solution 
{
    //尽量把大的饼干给胃口大的孩子
    public int findContentChildren(int[] g, int[] s) 
    {
       int res = 0;
       Arrays.sort(g);
       Arrays.sort(s);
       
       int i;
       int length;
       int temp;
       length = g.length;
       for(i=0;i<length/2;i++)
       {
           temp = g[i] ;
           g[i] = g[length-1-i];
           g[length-1-i] = temp;
       }

       length = s.length;
       for(i=0;i<length/2;i++)
       {
           temp = s[i] ;
           s[i] = s[length-1-i];
           s[length-1-i] = temp;
       }

       length = g.length;
       int length_s = s.length;
       int index_s=0;
       for(i=0;i<length;i++)
       {
           if(index_s<length_s&&s[index_s]>=g[i]) 
           {
              index_s++;
              res++; 
           }
       }

       
       return res;
    }
}