贪心算法

区间型贪心

• problem：一个会议室同时只能开一个会议，求安排最多会议数的方案
• result：按照结束时间最早的安排

class Program{
  	private:
        int start;
        int end;
    public:
    	Program(int start, int end){
            this->start = start;
            this->end = end;
        }
    	int getStart(){
            return start;
        }
    	int getEnd(){
            retturn end;
        }
    	int compare(Program pro){
            return this->getEnd() < pro.getEnd(); 
        }
};

int bestArrange(vector<Program> programs, int timePoint){
    sort(programs.begin(), programs.end(), Program::compare);
    int res = 0;
    for (int i = 0; i < programs.size(); i++){
        if (timePoint <= programs[i].getStart()){
            res++;
        	timePoint = programs[i].getEnd();
        }
    }
    return res;
}