代码随想录——455. 分发饼干

class Solution {
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int index = 0;
        int count = 0;
        for(int i = 0;i<s.length && index < g.length ;i++){
            if(s[i] >= g[index]){
                index++;
                count++;
            }
        }
        return count;
    }
}