java调度问题的贪心算法_贪心算法——区间调度问题

package greed;

import java.util.Arrays;

/**

* Created with IntelliJ IDEA.

* User: shihuichao

* Date: 14-1-14

* Time: 下午10:43

* To change this template use File | Settings | File Templates.

*/

public class Interval {

public static int interval(Work[] works) {

Arrays.sort(works);

int count = 0;

//当前工作的结束时间

int t = 0;

for (int i = 0; i < works.length; i++) {

if(t < works[i].getStart()) {

count ++;

t = works[i].getTerminate();

}

}

return count;

}

public static void main(String args[]) {

Work[] works = {

new Work(1, 3),

new Work(2, 5),

new Work(4, 7),

new Work(6, 9),

new Work(8, 10)

};

int result = interval(works);

System.out.println(result);

}

}

class Work implements Comparable {

private int start;

private int terminate;

Work(int start, int terminate) {

this.start = start;

this.terminate = terminate;

}

int getStart() {

return start;

}

void setStart(int start) {

this.start = start;

}

int getTerminate() {

return terminate;

}

void setTerminate(int terminate) {

this.terminate = terminate;

}

@Override

public int compareTo(Object o) {

Work work = (Work) o;

if (this.terminate > work.getTerminate())

return 1;

else if (this.terminate == work.getTerminate())

return 0;

else

return -1;

}

}