[LeetCode] 56. Merge Intervals - c++

C++ 풀이

class Solution {
public:
    vector<vector<int>> merge(vector<vector<int>>& interval) {
       vector<vector<int>> ans;
        if(interval.size()==0) return ans;
        sort(interval.begin(), interval.end());
        ans.push_back(interval[0]);
        
        int prev = 0;
        for(int i=1;i<interval.size();i++)
        {
            if(ans[prev][1]>=interval[i][0])
            {
                ans[prev][1]=max(ans[prev][1], interval[i][1]);
            }
            else
            {
                prev++;
                ans.push_back(interval[i]);
            }
        }
        return ans;
    }
};