50-Remove Covered Intervals

题目地址：Remove Covered Intervals。
Given a list of intervals, remove all intervals that are covered by another interval in the list. Interval [a,b) is covered by interval [c,d) if and only if c <= a and b <= d.
After doing so, return the number of remaining intervals.
Example 1:
Input: intervals = [[1,4],[3,6],[2,8]]
Output: 2
Explanation: Interval [3,6] is covered by [2,8], therefore it is removed.
Constraints:
1 <= intervals.length <= 1000
0 <= intervals[i][0] < intervals[i][1] <= 10^5
intervals[i] != intervals[j] for all i != j

class Solution {
    public int removeCoveredIntervals(int[][] intervals) {
         int length = intervals.length;
        //进行排序
        Arrays.sort(intervals, (a, b) -> (a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]));
        int[] pre = intervals[0];
        int res = recursion(pre, 1, intervals, length);
        return res ;
    } 
     private  int recursion(int[] pre, int pointer, int[][] intervals, int count) {
        if (pointer == intervals.length) {
            return count;
        }
        //含有就删除
        if (intervals[pointer][0] == pre[0]) {
            count = recursion(intervals[pointer], pointer + 1, intervals, count - 1);
        } else if (intervals[pointer][1] <= pre[1]) {
            count = recursion(pre, pointer + 1, intervals, count - 1);
        } else {
            count = recursion(intervals[pointer], pointer + 1, intervals, count);
        }
        return count;
    }
}