[leetcode整理]

=======简单

leetcode164 Maximum Gap sort两次

=======有参考

330 Patching Array

98 Validate Binary Search Tree BFS

60 Subsets II [done]

435 non-overlapping

public int eraseOverlapIntervals(Interval[] intervals) {
        if (intervals == null || intervals.length == 0){
            return 0;
        }
        Arrays.sort(intervals, new IntervalCompare());
        int end = intervals[0].end;
        int prev = 0;
        int count = 0;
        for(int i = 1; i < intervals.length; i++){
            if(intervals[prev].end > intervals[i].start){
                if(intervals[prev].end > intervals[i].end){
                    prev = i;
                }
                count++;
            }
            else{
                prev = i;
            }
        }
        return count;
    }

 455. Assign Cookies

class Solution {
    public int findContentChildren(int[] g, int[] s) {
        if(g == null || g.length == 0)return 0;
        if(s == null || s.length == 0)return 0;
        Arrays.sort(g);
        Arrays.sort(s);
        int cnt=0;
        int i=0;
        for(int gg:g){
            while(i<s.length && gg>s[i]) i++;
            if(i==s.length) break;
            cnt++;
            i++;
        }
        return cnt;
    }
}