452. Minimum Number of Arrows to Burst Balloons 5 jan

class Solution {
public:
    int findMinArrowShots(vector<vector<int>>& points) {
        sort(points.begin(),points.end());
        if(points.size()<=1)return 1;
        vector<vector<int>>intervals;
        int s=points[0][0];
        int e=points[0][1];
        int prev=0;
        for(int i=1;i<points.size();i++)
        {
            int sL=points[i][0];
            int eL=points[i][1];
            if(sL>e)
            {
                intervals.push_back({s,e});
                prev=i-1;
                s=sL;
                e=eL;
               
            }
            else
            {
                e=min(e,eL);
            }
        }
        if(prev!=points.size()-1)
        intervals.push_back({s,e});
        return intervals.size();

    }
};