利用贪心算法求上课时段的选择

import java.util.Array;
import java.util.Comparator;
public class BestArr {
  public static class Program {
    public int start;
    public int end;

    public Program(int start, int end) {
      this.start = start;
      this.end = end;
    }
  }

  public static class ProgramComparator implements Comparator<Program> {
    public int compare(Program p1, Program p2) { return p1.end - p2.end; }
  }

  public static int bestArr(Program[] programs, int start) {

    Arrays.sort(programs, new ProgramComparator());
    int result = 0;
    for (int i = 0; i < programs.length; i++) {
      if (start <= programs[i].start) {
        result++;
        start = programs[i].end;
      }
    }
    return result;
  }
}