贪心

455. Assign Cookies

Difficulty: Medium
Tags: Greedy Two Pointers

排序 若孩子的胃口大于饼干 则判断下一个饼干 若到了无饼干符合（j==n）则结束

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

435. Non-overlapping Intervals

Difficulty: Medium

--wait

605. Can Place Flowers

Difficulty: Easy

跳格子法

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int len = flowerbed.length;

        for(int i=0;i<len&&n>0;){
            if(flowerbed[i]==1){
                i+=2;
            }else if(i==len-1||flowerbed[i+1]==0){
                n--;
                i+=2;
            }else{
                i+=3;
            }
        }
        return n<=0;

    }
}