(贪心) leetcode 435 Non-overlapping Intervals, 455 design cookies

思路：       class Solution { public: //自定义比较函数,按照后端点排序 static bool cmp(vector<int>& a, vector<int>& b){ return a[1] < b[1]; } int eraseOverlapIntervals(vector<vector<int>>&

>>阅读原文<<