LeetCode455-分发饼干

排序+贪心思想

public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        //最大满足的孩子个数
        int count = 0;
        //饼干的个数
        int cookiesNum = s.length - 1;
        for (int i = g.length - 1; i >= 0; i--) {
            if (cookiesNum >= 0 && s[cookiesNum] >= g[i]) {
                count++;
                cookiesNum--;
            }
        }
        return count;
    }