题解 | #奶牛喂养时间#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param intervals int整型vector<vector<>> 
     * @return int整型vector<vector<>>
     */
    vector<vector<int> > mergeTimeIntervals(vector<vector<int> >& intervals) 
    {
        // write code here
        vector<vector<int>> result;
        sort(intervals.begin(),intervals.end(),[](const vector<int>& a,const vector<int>& b)
        {
            return a[0] < b[0];
        });
        int left = intervals[0][0];
        int right = intervals[0][1];
        for (int i = 1;i < intervals.size();++i)
        {
            if (intervals[i][0] <= right)
            {
                right = max(right,intervals[i][1]);
            }
            else
            {
                vector<int> temp;
                temp.push_back(left);
                temp.push_back(right);
                result.push_back(temp);
                left = intervals[i][0];
                right = intervals[i][1];
            }
            if (i == intervals.size() - 1)
            {
                vector<int> temp;
                temp.push_back(left);
                temp.push_back(right);
                result.push_back(temp);
            }
        }
        return result;
    }
};

不知道大家能不能看懂