455. 分发饼干 排序+贪心算法

class Solution:  #python
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        count=0
        i=j=0
        while i<len(g) and j<len(s):
            if g[i]<=s[j]:
                i+=1          
                count+=1
            j+=1
        return count

class Solution {  //java
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        
        int cookie=s.length-1;
        int count=0;
        for(int child=g.length-1;cookie>=0&&child>=0;child--){
            if(s[cookie]>=g[child]){
                count++;
                cookie--;
            }
        }
        return count;
    }
}